<?xml version="1.0" encoding="ISO-8859-1"?>

<rdf:RDF
 xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
 xmlns="http://purl.org/rss/1.0/"
 xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/"
 xmlns:dc="http://purl.org/dc/elements/1.1/"
 xmlns:syn="http://purl.org/rss/1.0/modules/syndication/"
 xmlns:prism="http://purl.org/rss/1.0/modules/prism/"
 xmlns:admin="http://webns.net/mvcb/"
>

<channel rdf:about="http://bioinformatics.oxfordjournals.org">
<title>Bioinformatics - current issue</title>
<link>http://bioinformatics.oxfordjournals.org</link>
<description>Bioinformatics - RSS feed of current issue</description>
<prism:eIssn>1460-2059</prism:eIssn>
<prism:coverDisplayDate>15 May 2008</prism:coverDisplayDate>
<prism:publicationName>Bioinformatics</prism:publicationName>
<prism:issn>1367-4803</prism:issn>
<items>
 <rdf:Seq>
  <rdf:li rdf:resource="http://bioinformatics.oxfordjournals.org/cgi/content/short/24/10/1225?rss=1" />
  <rdf:li rdf:resource="http://bioinformatics.oxfordjournals.org/cgi/content/short/24/10/1229?rss=1" />
  <rdf:li rdf:resource="http://bioinformatics.oxfordjournals.org/cgi/content/short/24/10/1236?rss=1" />
  <rdf:li rdf:resource="http://bioinformatics.oxfordjournals.org/cgi/content/short/24/10/1243?rss=1" />
  <rdf:li rdf:resource="http://bioinformatics.oxfordjournals.org/cgi/content/short/24/10/1251?rss=1" />
  <rdf:li rdf:resource="http://bioinformatics.oxfordjournals.org/cgi/content/short/24/10/1257?rss=1" />
  <rdf:li rdf:resource="http://bioinformatics.oxfordjournals.org/cgi/content/short/24/10/1264?rss=1" />
  <rdf:li rdf:resource="http://bioinformatics.oxfordjournals.org/cgi/content/short/24/10/1271?rss=1" />
  <rdf:li rdf:resource="http://bioinformatics.oxfordjournals.org/cgi/content/short/24/10/1278?rss=1" />
  <rdf:li rdf:resource="http://bioinformatics.oxfordjournals.org/cgi/content/short/24/10/1286?rss=1" />
  <rdf:li rdf:resource="http://bioinformatics.oxfordjournals.org/cgi/content/short/24/10/1293?rss=1" />
  <rdf:li rdf:resource="http://bioinformatics.oxfordjournals.org/cgi/content/short/24/10/1300?rss=1" />
  <rdf:li rdf:resource="http://bioinformatics.oxfordjournals.org/cgi/content/short/24/10/1305?rss=1" />
  <rdf:li rdf:resource="http://bioinformatics.oxfordjournals.org/cgi/content/short/24/10/1307?rss=1" />
  <rdf:li rdf:resource="http://bioinformatics.oxfordjournals.org/cgi/content/short/24/10/1310?rss=1" />
  <rdf:li rdf:resource="http://bioinformatics.oxfordjournals.org/cgi/content/short/24/10/1313?rss=1" />
  <rdf:li rdf:resource="http://bioinformatics.oxfordjournals.org/cgi/content/short/24/10/1316?rss=1" />
  <rdf:li rdf:resource="http://bioinformatics.oxfordjournals.org/cgi/content/short/24/10/1318?rss=1" />
  <rdf:li rdf:resource="http://bioinformatics.oxfordjournals.org/cgi/content/short/24/10/1321?rss=1" />
  <rdf:li rdf:resource="http://bioinformatics.oxfordjournals.org/cgi/content/short/24/10/1323?rss=1" />
 </rdf:Seq>
</items>
</channel>

<item rdf:about="http://bioinformatics.oxfordjournals.org/cgi/content/short/24/10/1225?rss=1">
<title><![CDATA[A note on the false discovery rate and inconsistent comparisons between experiments]]></title>
<link>http://bioinformatics.oxfordjournals.org/cgi/content/short/24/10/1225?rss=1</link>
<description><![CDATA[
<p><b>Motivation:</b> The false discovery rate (FDR) has been widely adopted to address the multiple comparisons issue in high-throughput experiments such as microarray gene-expression studies. However, while the FDR is quite useful as an approach to limit false discoveries within a single experiment, like other multiple comparison corrections it may be an inappropriate way to compare results across experiments. This article uses several examples based on gene-expression data to demonstrate the potential misinterpretations that can arise from using FDR to compare across experiments. Researchers should be aware of these pitfalls and wary of using FDR to compare experimental results. FDR should be augmented with other measures such as <I>p</I>-values and expression ratios. It is worth including standard error and variance information for meta-analyses and, if possible, the raw data for re-analyses. This is especially important for high-throughput studies because data are often re-used for different objectives, including comparing common elements across many experiments. No single error rate or data summary may be appropriate for all of the different objectives.</p>
<p><b>Contact:</b>  <inter-ref locator="Eugene.Kolker@seattlechildrens.org" locator-type="email">Eugene.Kolker@seattlechildrens.org</inter-ref></p>
]]></description>
<dc:creator><![CDATA[Higdon, R., van Belle, G., Kolker, E.]]></dc:creator>
<dc:date>2008-05-07</dc:date>
<dc:identifier>info:doi/10.1093/bioinformatics/btn120</dc:identifier>
<dc:title><![CDATA[A note on the false discovery rate and inconsistent comparisons between experiments]]></dc:title>
<dc:publisher>Oxford University Press</dc:publisher>
<prism:number>10</prism:number>
<prism:volume>24</prism:volume>
<prism:endingPage>1228</prism:endingPage>
<prism:publicationDate>2008-05-15</prism:publicationDate>
<prism:startingPage>1225</prism:startingPage>
<prism:section>DATA AND TEXT MINING</prism:section>
</item>

<item rdf:about="http://bioinformatics.oxfordjournals.org/cgi/content/short/24/10/1229?rss=1">
<title><![CDATA[Scaffolding and validation of bacterial genome assemblies using optical restriction maps]]></title>
<link>http://bioinformatics.oxfordjournals.org/cgi/content/short/24/10/1229?rss=1</link>
<description><![CDATA[
<p><b>Motivation:</b> New, high-throughput sequencing technologies have made it feasible to cheaply generate vast amounts of sequence information from a genome of interest. The computational reconstruction of the complete sequence of a genome is complicated by specific features of these new sequencing technologies, such as the short length of the sequencing reads and absence of mate-pair information. In this article we propose methods to overcome such limitations by incorporating information from optical restriction maps.</p>
<p><b>Results:</b> We demonstrate the robustness of our methods to sequencing and assembly errors using extensive experiments on simulated datasets. We then present the results obtained by applying our algorithms to data generated from two bacterial genomes <I>Yersinia aldovae</I> and <I>Yersinia kristensenii</I>. The resulting assemblies contain a single scaffold covering a large fraction of the respective genomes, suggesting that the careful use of optical maps can provide a cost-effective framework for the assembly of genomes.</p>
<p><b>Availability:</b> The tools described here are available as an open-source package at <inter-ref locator="ftp://ftp.cbcb.umd.edu/pub/software/soma" locator-type="url">ftp://ftp.cbcb.umd.edu/pub/software/soma</inter-ref></p>
<p><b>Contact:</b>  <inter-ref locator="mpop@umiacs.umd.edu" locator-type="email">mpop@umiacs.umd.edu</inter-ref></p>
]]></description>
<dc:creator><![CDATA[Nagarajan, N., Read, T. D., Pop, M.]]></dc:creator>
<dc:date>2008-05-07</dc:date>
<dc:identifier>info:doi/10.1093/bioinformatics/btn102</dc:identifier>
<dc:title><![CDATA[Scaffolding and validation of bacterial genome assemblies using optical restriction maps]]></dc:title>
<dc:publisher>Oxford University Press</dc:publisher>
<prism:number>10</prism:number>
<prism:volume>24</prism:volume>
<prism:endingPage>1235</prism:endingPage>
<prism:publicationDate>2008-05-15</prism:publicationDate>
<prism:startingPage>1229</prism:startingPage>
<prism:section>GENOME ANALYSIS</prism:section>
</item>

<item rdf:about="http://bioinformatics.oxfordjournals.org/cgi/content/short/24/10/1236?rss=1">
<title><![CDATA[Combining statistical alignment and phylogenetic footprinting to detect regulatory elements]]></title>
<link>http://bioinformatics.oxfordjournals.org/cgi/content/short/24/10/1236?rss=1</link>
<description><![CDATA[
<p><b>Motivation:</b> Traditional alignment-based phylogenetic footprinting approaches make predictions on the basis of a single assumed alignment. The predictions are therefore highly sensitive to alignment errors or regions of alignment uncertainty. Alternatively, statistical alignment methods provide a framework for performing phylogenetic analyses by examining a distribution of alignments.</p>
<p><b>Results:</b> We developed a novel algorithm for predicting functional elements by combining statistical alignment and phylogenetic footprinting (SAPF). SAPF simultaneously performs both alignment and annotation by combining phylogenetic footprinting techniques with an hidden Markov model (HMM) transducer-based multiple alignment model, and can analyze sequence data from multiple sequences. We assessed SAPF's predictive performance on two simulated datasets and three well-annotated <I>cis</I>-regulatory modules from newly sequenced <I>Drosophila</I> genomes. The results demonstrate that removing the traditional dependence on a single alignment can significantly augment the predictive performance, especially when there is uncertainty in the alignment of functional regions.</p>
<p><b>Availability:</b> SAPF is freely available to download online at <inter-ref locator="http://www.stats.ox.ac.uk/~satija/SAPF/" locator-type="url">http://www.stats.ox.ac.uk/~satija/SAPF/</inter-ref></p>
<p><b>Contact:</b>  <inter-ref locator="satija@stats.ox.ac.uk" locator-type="email">satija@stats.ox.ac.uk</inter-ref></p>
<p><b>Supplementary information:</b> Supplementary data are available at <I>Bioinformatics</I> online.</p>
]]></description>
<dc:creator><![CDATA[Satija, R., Pachter, L., Hein, J.]]></dc:creator>
<dc:date>2008-05-07</dc:date>
<dc:identifier>info:doi/10.1093/bioinformatics/btn104</dc:identifier>
<dc:title><![CDATA[Combining statistical alignment and phylogenetic footprinting to detect regulatory elements]]></dc:title>
<dc:publisher>Oxford University Press</dc:publisher>
<prism:number>10</prism:number>
<prism:volume>24</prism:volume>
<prism:endingPage>1242</prism:endingPage>
<prism:publicationDate>2008-05-15</prism:publicationDate>
<prism:startingPage>1236</prism:startingPage>
<prism:section>SEQUENCE ANALYSIS</prism:section>
</item>

<item rdf:about="http://bioinformatics.oxfordjournals.org/cgi/content/short/24/10/1243?rss=1">
<title><![CDATA[Analysis of correlated mutations in HIV-1 protease using spectral clustering]]></title>
<link>http://bioinformatics.oxfordjournals.org/cgi/content/short/24/10/1243?rss=1</link>
<description><![CDATA[
<p><b>Motivation:</b> The ability of human immunodeficiency virus-1 (HIV-1) protease to develop mutations that confer multi-drug resistance (MDR) has been a major obstacle in designing rational therapies against HIV. Resistance is usually imparted by a cooperative mechanism that can be elucidated by a covariance analysis of sequence data. Identification of such correlated substitutions of amino acids may be obscured by evolutionary noise.</p>
<p><b>Results:</b> HIV-1 protease sequences from patients subjected to different specific treatments (set 1), and from untreated patients (set 2) were subjected to sequence covariance analysis by evaluating the mutual information (MI) between all residue pairs. Spectral clustering of the resulting covariance matrices disclosed two distinctive clusters of correlated residues: the first, observed in set 1 but absent in set 2, contained residues involved in MDR acquisition; and the second, included those residues differentiated in the various HIV-1 protease subtypes, shortly referred to as the phylogenetic cluster. The MDR cluster occupies sites close to the central symmetry axis of the enzyme, which overlap with the global hinge region identified from coarse-grained normal-mode analysis of the enzyme structure. The phylogenetic cluster, on the other hand, occupies solvent-exposed and highly mobile regions. This study demonstrates (i) the possibility of distinguishing between the correlated substitutions resulting from neutral mutations and those induced by MDR upon appropriate clustering analysis of sequence covariance data and (ii) a connection between global dynamics and functional substitution of amino acids.</p>
<p><b>Contact:</b>  <inter-ref locator="bahar@ccbb.pitt.edu" locator-type="email">bahar@ccbb.pitt.edu</inter-ref></p>
<p><b>Supplementary information:</b> Supplementary data are available at <I>Bioinformatics</I> online.</p>
]]></description>
<dc:creator><![CDATA[Liu, Y., Eyal, E., Bahar, I.]]></dc:creator>
<dc:date>2008-05-07</dc:date>
<dc:identifier>info:doi/10.1093/bioinformatics/btn110</dc:identifier>
<dc:title><![CDATA[Analysis of correlated mutations in HIV-1 protease using spectral clustering]]></dc:title>
<dc:publisher>Oxford University Press</dc:publisher>
<prism:number>10</prism:number>
<prism:volume>24</prism:volume>
<prism:endingPage>1250</prism:endingPage>
<prism:publicationDate>2008-05-15</prism:publicationDate>
<prism:startingPage>1243</prism:startingPage>
<prism:section>SEQUENCE ANALYSIS</prism:section>
</item>

<item rdf:about="http://bioinformatics.oxfordjournals.org/cgi/content/short/24/10/1251?rss=1">
<title><![CDATA[Domain annotation of trimeric autotransporter adhesins--daTAA]]></title>
<link>http://bioinformatics.oxfordjournals.org/cgi/content/short/24/10/1251?rss=1</link>
<description><![CDATA[
<p><b>Motivation:</b> Trimeric autotransporter adhesins (TAAs), such as <I>Yersinia</I> YadA, <I>Neisseria</I> NadA, <I>Moraxella</I> UspAs, <I>Haemophilus</I> Hia and <I>Bartonella</I> BadA, are important pathogenicity factors of proteobacteria. Their high sequence diversity and distinct mosaic-like structure lead to difficulties in the annotation of their sequences. These stem from the large number of short repeats, the presence of compositionally unusual coiled-coils, fuzzy domain boundaries and regions of seemingly low sequence complexity.</p>
<p><b>Results:</b> We have developed a workflow, named daTAA, for the accurate domain annotation of TAAs. Its core consists of manually curated alignments and of knowledge-based rules that enhance assignments made by sequence similarity. Compared to general domain annotation servers such as PFAM, daTAA captures more domains and provides more sensitive domain detection, as well as integrated and detailed coiled-coil assignments.</p>
<p><b>Availability:</b> The daTAA server is freely accessible at <inter-ref locator="http://toolkit.tuebingen.mpg.de/dataa" locator-type="url">http://toolkit.tuebingen.mpg.de/dataa</inter-ref></p>
<p><b>Contact:</b>  <inter-ref locator="andrei.lupas@tuebingen.mpg.de" locator-type="email">andrei.lupas@tuebingen.mpg.de</inter-ref></p>
<p><b>Supplementary information:</b> Supplementary data are available at <I>Bioinformatics</I> online.</p>
]]></description>
<dc:creator><![CDATA[Szczesny, P., Lupas, A.]]></dc:creator>
<dc:date>2008-05-07</dc:date>
<dc:identifier>info:doi/10.1093/bioinformatics/btn118</dc:identifier>
<dc:title><![CDATA[Domain annotation of trimeric autotransporter adhesins--daTAA]]></dc:title>
<dc:publisher>Oxford University Press</dc:publisher>
<prism:number>10</prism:number>
<prism:volume>24</prism:volume>
<prism:endingPage>1256</prism:endingPage>
<prism:publicationDate>2008-05-15</prism:publicationDate>
<prism:startingPage>1251</prism:startingPage>
<prism:section>SEQUENCE ANALYSIS</prism:section>
</item>

<item rdf:about="http://bioinformatics.oxfordjournals.org/cgi/content/short/24/10/1257?rss=1">
<title><![CDATA[Assigning functional linkages to proteins using phylogenetic profiles and continuous phenotypes]]></title>
<link>http://bioinformatics.oxfordjournals.org/cgi/content/short/24/10/1257?rss=1</link>
<description><![CDATA[
<p><b>Motivation:</b> A class of non-homology-based methods for protein function prediction relies on the assumption that genes linked to a phenotypic trait are preferentially conserved among organisms that share the trait. These methods typically compare pairs of binary strings, where one string encodes the phylogenetic distribution of a trait and the other of a protein. In this work, we extended the approach to automatically deal with continuous phenotypes.</p>
<p><b>Results:</b> Rather than use a priori rules, which can be very subjective, to construct binary profiles from continuous phenotypes, we propose to systematically explore thresholds which can meaningfully separate the phenotype values. We illustrate our method by analyzing optimal growth temperatures, and demonstrate its usefulness by automatically retrieving genes which have been associated with thermophilic growth. We also apply the general approach, for the first time, to optimal growth pH, and make novel predictions. Finally, we show that our method can also be applied to other properties which may not be classically considered as phenotypes. Specifically, we studied correlations between genome size and the distribution of genes.</p>
<p><b>Contact:</b>  <inter-ref locator="orlandgonzalez@gmail.com" locator-type="email">orlandgonzalez@gmail.com</inter-ref></p>
<p><b>Supplementary information:</b> Supplementary data are available at <I>Bioinformatics</I> online.</p>
]]></description>
<dc:creator><![CDATA[Gonzalez, O., Zimmer, R.]]></dc:creator>
<dc:date>2008-05-07</dc:date>
<dc:identifier>info:doi/10.1093/bioinformatics/btn106</dc:identifier>
<dc:title><![CDATA[Assigning functional linkages to proteins using phylogenetic profiles and continuous phenotypes]]></dc:title>
<dc:publisher>Oxford University Press</dc:publisher>
<prism:number>10</prism:number>
<prism:volume>24</prism:volume>
<prism:endingPage>1263</prism:endingPage>
<prism:publicationDate>2008-05-15</prism:publicationDate>
<prism:startingPage>1257</prism:startingPage>
<prism:section>PHYLOGENETICS</prism:section>
</item>

<item rdf:about="http://bioinformatics.oxfordjournals.org/cgi/content/short/24/10/1264?rss=1">
<title><![CDATA[Probabilistic multi-class multi-kernel learning: on protein fold recognition and remote homology detection]]></title>
<link>http://bioinformatics.oxfordjournals.org/cgi/content/short/24/10/1264?rss=1</link>
<description><![CDATA[
<p><b>Motivation:</b> The problems of protein fold recognition and remote homology detection have recently attracted a great deal of interest as they represent challenging multi-feature multi-class problems for which modern pattern recognition methods achieve only modest levels of performance. As with many pattern recognition problems, there are multiple feature spaces or groups of attributes available, such as global characteristics like the amino-acid composition (C), predicted secondary structure (S), hydrophobicity (H), van der Waals volume (V), polarity (P), polarizability (Z), as well as attributes derived from local sequence alignment such as the Smith&ndash;Waterman scores. This raises the need for a classification method that is able to assess the contribution of these potentially heterogeneous object descriptors while utilizing such information to improve predictive performance. To that end, we offer a single multi-class kernel machine that informatively combines the available feature groups and, as is demonstrated in this article, is able to provide the state-of-the-art in performance accuracy on the fold recognition problem. Furthermore, the proposed approach provides some insight by assessing the significance of recently introduced protein features and string kernels. The proposed method is well-founded within a Bayesian hierarchical framework and a variational Bayes approximation is derived which allows for efficient CPU processing times.</p>
<p><b>Results:</b> The best performance which we report on the SCOP PDB-40D benchmark data-set is a 70% accuracy by combining all the available feature groups from global protein characteristics but also including sequence-alignment features. We offer an 8% improvement on the best reported performance that combines multi-class <I>k</I>-nn classifiers while at the same time reducing computational costs and assessing the predictive power of the various available features. Furthermore, we examine the performance of our methodology on the SCOP 1.53 benchmark data-set that simulates remote homology detection and examine the combination of various state-of-the-art string kernels that have recently been proposed.</p>
<p><b>Contact:</b>  <inter-ref locator="theo@dcs.gla.ac.uk" locator-type="email">theo@dcs.gla.ac.uk</inter-ref></p>
<p><b>Supplementary information:</b> Supplementary data are available at <I>Bioinformatics</I> online.</p>
]]></description>
<dc:creator><![CDATA[Damoulas, T., Girolami, M. A.]]></dc:creator>
<dc:date>2008-05-07</dc:date>
<dc:identifier>info:doi/10.1093/bioinformatics/btn112</dc:identifier>
<dc:title><![CDATA[Probabilistic multi-class multi-kernel learning: on protein fold recognition and remote homology detection]]></dc:title>
<dc:publisher>Oxford University Press</dc:publisher>
<prism:number>10</prism:number>
<prism:volume>24</prism:volume>
<prism:endingPage>1270</prism:endingPage>
<prism:publicationDate>2008-05-15</prism:publicationDate>
<prism:startingPage>1264</prism:startingPage>
<prism:section>STRUCTURAL BIOINFORMATICS</prism:section>
</item>

<item rdf:about="http://bioinformatics.oxfordjournals.org/cgi/content/short/24/10/1271?rss=1">
<title><![CDATA[Prediction of the translocon-mediated membrane insertion free energies of protein sequences]]></title>
<link>http://bioinformatics.oxfordjournals.org/cgi/content/short/24/10/1271?rss=1</link>
<description><![CDATA[
<p><b>Motivation:</b> Helical membrane proteins (HMPs) play crucial roles in a variety of cellular processes. Unlike water-soluble proteins, HMPs need not only to fold but also get inserted into the membrane to be fully functional. This process of membrane insertion is mediated by the translocon complex. Thus, it is of great interest to develop computational methods for predicting the translocon-mediated membrane insertion free energies of protein sequences.</p>
<p><b>Result:</b> We have developed Membrane Insertion (MINS), a novel sequence-based computational method for predicting the membrane insertion free energies of protein sequences. A benchmark test gives a correlation coefficient of 0.74 between predicted and observed free energies for 357 known cases, which corresponds to a mean unsigned error of 0.41 kcal/mol. These results are significantly better than those obtained by traditional hydropathy analysis. Moreover, the ability of MINS to reasonably predict membrane insertion free energies of protein sequences allows for effective identification of transmembrane (TM) segments. Subsequently, MINS was applied to predict the membrane insertion free energies of 316 TM segments found in known structures. An in-depth analysis of the predicted free energies reveals a number of interesting findings about the biogenesis and structural stability of HMPs.</p>
<p><b>Availability:</b> A web server for MINS is available at <inter-ref locator="http://service.bioinformatik.uni-saarland.de/mins" locator-type="url">http://service.bioinformatik.uni-saarland.de/mins</inter-ref></p>
<p><b>Contact:</b>  <inter-ref locator="volkhard.helms@bioinformatik.uni-saarland.de" locator-type="email">volkhard.helms@bioinformatik.uni-saarland.de</inter-ref></p>
<p><b>Supplementary information</b>: Supplementary data are available at <I>Bioinformatic</I> online.</p>
]]></description>
<dc:creator><![CDATA[Park, Y., Helms, V.]]></dc:creator>
<dc:date>2008-05-07</dc:date>
<dc:identifier>info:doi/10.1093/bioinformatics/btn114</dc:identifier>
<dc:title><![CDATA[Prediction of the translocon-mediated membrane insertion free energies of protein sequences]]></dc:title>
<dc:publisher>Oxford University Press</dc:publisher>
<prism:number>10</prism:number>
<prism:volume>24</prism:volume>
<prism:endingPage>1277</prism:endingPage>
<prism:publicationDate>2008-05-15</prism:publicationDate>
<prism:startingPage>1271</prism:startingPage>
<prism:section>STRUCTURAL BIOINFORMATICS</prism:section>
</item>

<item rdf:about="http://bioinformatics.oxfordjournals.org/cgi/content/short/24/10/1278?rss=1">
<title><![CDATA[An improved physico-chemical model of hybridization on high-density oligonucleotide microarrays]]></title>
<link>http://bioinformatics.oxfordjournals.org/cgi/content/short/24/10/1278?rss=1</link>
<description><![CDATA[
<p><b>Motivation:</b> High-density DNA microarrays provide useful tools to analyze gene expression comprehensively. However, it is still difficult to obtain accurate expression levels from the observed microarray data because the signal intensity is affected by complicated factors involving probe&ndash;target hybridization, such as non-linear behavior of hybridization, non-specific hybridization, and folding of probe and target oligonucleotides. Various methods for microarray data analysis have been proposed to address this problem. In our previous report, we presented a benchmark analysis of probe&ndash;target hybridization using artificially synthesized oligonucleotides as targets, in which the effect of non-specific hybridization was negligible. The results showed that the preceding models explained the behavior of probe&ndash;target hybridization only within a narrow range of target concentrations. More accurate models are required for quantitative expression analysis.</p>
<p><b>Results:</b> The experiments showed that finiteness of both probe and target molecules should be considered to explain the hybridization behavior. In this article, we present an extension of the Langmuir model that reproduces the experimental results consistently. In this model, we introduced the effects of secondary structure formation, and dissociation of the probe&ndash;target duplex during washing after hybridization. The results will provide useful methods for the understanding and analysis of microarray experiments.</p>
<p><b>Availability:</b> The method was implemented for the R software and can be downloaded from our website (<inter-ref locator="http://www-shimizu.ist.osaka-u.ac.jp/shimizu_lab/FHarray/" locator-type="url">http://www-shimizu.ist.osaka-u.ac.jp/shimizu_lab/FHarray/</inter-ref>).</p>
<p><b>Contact:</b>  <inter-ref locator="furusawa@ist.osaka-u.ac.jp" locator-type="email">furusawa@ist.osaka-u.ac.jp</inter-ref></p>
<p><b>Supplementary information:</b> Supplementary data are available at <I>Bioinformatics</I> online.</p>
]]></description>
<dc:creator><![CDATA[Ono, N., Suzuki, S., Furusawa, C., Agata, T., Kashiwagi, A., Shimizu, H., Yomo, T.]]></dc:creator>
<dc:date>2008-05-07</dc:date>
<dc:identifier>info:doi/10.1093/bioinformatics/btn109</dc:identifier>
<dc:title><![CDATA[An improved physico-chemical model of hybridization on high-density oligonucleotide microarrays]]></dc:title>
<dc:publisher>Oxford University Press</dc:publisher>
<prism:number>10</prism:number>
<prism:volume>24</prism:volume>
<prism:endingPage>1285</prism:endingPage>
<prism:publicationDate>2008-05-15</prism:publicationDate>
<prism:startingPage>1278</prism:startingPage>
<prism:section>GENE EXPRESSION</prism:section>
</item>

<item rdf:about="http://bioinformatics.oxfordjournals.org/cgi/content/short/24/10/1286?rss=1">
<title><![CDATA[Linear time-varying models can reveal non-linear interactions of biomolecular regulatory networks using multiple time-series data]]></title>
<link>http://bioinformatics.oxfordjournals.org/cgi/content/short/24/10/1286?rss=1</link>
<description><![CDATA[
<p><b>Motivation:</b> Inherent non-linearities in biomolecular interactions make the identification of network interactions difficult. One of the principal problems is that all methods based on the use of linear time-invariant models will have fundamental limitations in their capability to infer certain non-linear network interactions. Another difficulty is the multiplicity of possible solutions, since, for a given dataset, there may be many different possible networks which generate the same time-series expression profiles.</p>
<p><b>Results:</b> A novel algorithm for the inference of biomolecular interaction networks from temporal expression data is presented. Linear time-varying models, which can represent a much wider class of time-series data than linear time-invariant models, are employed in the algorithm. From time-series expression profiles, the model parameters are identified by solving a non-linear optimization problem. In order to systematically reduce the set of possible solutions for the optimization problem, a filtering process is performed using a phase-portrait analysis with random numerical perturbations. The proposed approach has the advantages of not requiring the system to be in a stable steady state, of using time-series profiles which have been generated by a single experiment, and of allowing non-linear network interactions to be identified. The ability of the proposed algorithm to correctly infer network interactions is illustrated by its application to three examples: a non-linear model for cAMP oscillations in <I>Dictyostelium discoideum</I>, the cell-cycle data for <I>Saccharomyces cerevisiae</I> and a large-scale non-linear model of a group of synchronized <I>Dictyostelium</I> cells.</p>
<p><b>Availability:</b> The software used in this article is available from <inter-ref locator="http://sbie.kaist.ac.kr/software" locator-type="url">http://sbie.kaist.ac.kr/software</inter-ref></p>
<p><b>Contact:</b>  <inter-ref locator="ckh@kaist.ac.kr" locator-type="email">ckh@kaist.ac.kr</inter-ref></p>
<p><b>Supplementary information:</b> Supplementary data are available at <I>Bioinformatics</I> online.</p>
]]></description>
<dc:creator><![CDATA[Kim, J., Bates, D. G., Postlethwaite, I., Heslop-Harrison, P., Cho, K.-H.]]></dc:creator>
<dc:date>2008-05-07</dc:date>
<dc:identifier>info:doi/10.1093/bioinformatics/btn107</dc:identifier>
<dc:title><![CDATA[Linear time-varying models can reveal non-linear interactions of biomolecular regulatory networks using multiple time-series data]]></dc:title>
<dc:publisher>Oxford University Press</dc:publisher>
<prism:number>10</prism:number>
<prism:volume>24</prism:volume>
<prism:endingPage>1292</prism:endingPage>
<prism:publicationDate>2008-05-15</prism:publicationDate>
<prism:startingPage>1286</prism:startingPage>
<prism:section>SYSTEMS BIOLOGY</prism:section>
</item>

<item rdf:about="http://bioinformatics.oxfordjournals.org/cgi/content/short/24/10/1293?rss=1">
<title><![CDATA[Peak bagging for peptide mass fingerprinting]]></title>
<link>http://bioinformatics.oxfordjournals.org/cgi/content/short/24/10/1293?rss=1</link>
<description><![CDATA[
<p><b>Motivation:</b> Mass Spectrometry (MS)-based protein identification via peptide mass fingerprinting (PMF) is a key component in high-throughput proteome research. While PMF was the first commonly used protein identification method, provided higher throughput than the tandem MS-based method, its accuracy is lower than that of the tandem MS method. Thus, it is desirable to develop PMF-based algorithm with higher protein identification accuracy to facilitate proteome research.</p>
<p><b>Results:</b> We propose a peak bagging method for single MS-based protein identification. It combines results from multiple PMF algorithms, where each PMF algorithm takes a random peak subset as input. Evaluation with a set of real MALDI-TOF MS spectra shows that the new peak bagging method provides consistent improvements over the single PMF algorithm.</p>
<p><b>Contact:</b>  <inter-ref locator="eezyhe@ust.hk" locator-type="email">eezyhe@ust.hk</inter-ref></p>
]]></description>
<dc:creator><![CDATA[He, Z., Yang, C., Yu, W.]]></dc:creator>
<dc:date>2008-05-07</dc:date>
<dc:identifier>info:doi/10.1093/bioinformatics/btn123</dc:identifier>
<dc:title><![CDATA[Peak bagging for peptide mass fingerprinting]]></dc:title>
<dc:publisher>Oxford University Press</dc:publisher>
<prism:number>10</prism:number>
<prism:volume>24</prism:volume>
<prism:endingPage>1299</prism:endingPage>
<prism:publicationDate>2008-05-15</prism:publicationDate>
<prism:startingPage>1293</prism:startingPage>
<prism:section>DATA AND TEXT MINING</prism:section>
</item>

<item rdf:about="http://bioinformatics.oxfordjournals.org/cgi/content/short/24/10/1300?rss=1">
<title><![CDATA[ASPicDB: A database resource for alternative splicing analysis]]></title>
<link>http://bioinformatics.oxfordjournals.org/cgi/content/short/24/10/1300?rss=1</link>
<description><![CDATA[
<p><b>Motivation:</b> Alternative splicing has recently emerged as a key mechanism responsible for the expansion of transcriptome and proteome complexity in human and other organisms. Although several online resources devoted to alternative splicing analysis are available they may suffer from limitations related both to the computational methodologies adopted and to the extent of the annotations they provide that prevent the full exploitation of the available data. Furthermore, current resources provide limited query and download facilities.</p>
<p><b>Results:</b> ASPicDB is a database designed to provide access to reliable annotations of the alternative splicing pattern of human genes and to the functional annotation of predicted splicing isoforms. Splice-site detection and full-length transcript modeling have been carried out by a genome-wide application of the ASPic algorithm, based on the multiple alignments of gene-related transcripts (typically a Unigene cluster) to the genomic sequence, a strategy that greatly improves prediction accuracy compared to methods based on independent and progressive alignments.</p>
<p>Enhanced query and download facilities for annotations and sequences allow users to select and extract specific sets of data related to genes, transcripts and introns fulfilling a combination of user-defined criteria. Several tabular and graphical views of the results are presented, providing a comprehensive assessment of the functional implication of alternative splicing in the gene set under investigation.</p>
<p>ASPicDB, which is regularly updated on a monthly basis, also includes information on tissue-specific splicing patterns of normal and cancer cells, based on available EST sequences and their library source annotation.</p>
<p><b>Availability:</b> <inter-ref locator="http://www.caspur.it/ASPicDB" locator-type="url">www.caspur.it/ASPicDB</inter-ref></p>
<p><b>Contact:</b>  <inter-ref locator="graziano.pesole@biologia.uniba.it" locator-type="email">graziano.pesole@biologia.uniba.it</inter-ref></p>
<p><b>Supplementary information:</b> Supplementary data are available at <I>Bioinformatics</I> online.</p>
]]></description>
<dc:creator><![CDATA[Castrignano, T., D'Antonio, M., Anselmo, A., Carrabino, D., D'Onorio De Meo, A., D'Erchia, A. M., Licciulli, F., Mangiulli, M., Mignone, F., Pavesi, G., Picardi, E., Riva, A., Rizzi, R., Bonizzoni, P., Pesole, G.]]></dc:creator>
<dc:date>2008-05-07</dc:date>
<dc:identifier>info:doi/10.1093/bioinformatics/btn113</dc:identifier>
<dc:title><![CDATA[ASPicDB: A database resource for alternative splicing analysis]]></dc:title>
<dc:publisher>Oxford University Press</dc:publisher>
<prism:number>10</prism:number>
<prism:volume>24</prism:volume>
<prism:endingPage>1304</prism:endingPage>
<prism:publicationDate>2008-05-15</prism:publicationDate>
<prism:startingPage>1300</prism:startingPage>
<prism:section>DATABASES AND ONTOLOGIES</prism:section>
</item>

<item rdf:about="http://bioinformatics.oxfordjournals.org/cgi/content/short/24/10/1305?rss=1">
<title><![CDATA[GeneTrack--a genomic data processing and visualization framework]]></title>
<link>http://bioinformatics.oxfordjournals.org/cgi/content/short/24/10/1305?rss=1</link>
<description><![CDATA[
<p><b>Motivation:</b> High-throughput &lsquo;ChIP-chip&rsquo; and &lsquo;ChIP-seq&rsquo; methodologies generate sufficiently large data sets that analysis poses significant informatics challenges, particularly for research groups with modest computational support. To address this challenge, we devised a software platform for storing, analyzing and visualizing high resolution genome-wide binding data. GeneTrack automates several steps of a typical data processing pipeline, including smoothing and peak detection, and facilitates dissemination of the results via the web. Our software is freely available via the Google Project Hosting environment at <inter-ref locator="http://genetrack.googlecode.com" locator-type="url">http://genetrack.googlecode.com</inter-ref></p>
<p><b>Contact:</b>  <inter-ref locator="iual@psu.edu" locator-type="email">iual@psu.edu</inter-ref></p>
]]></description>
<dc:creator><![CDATA[Albert, I., Wachi, S., Jiang, C., Pugh, B. F.]]></dc:creator>
<dc:date>2008-05-07</dc:date>
<dc:identifier>info:doi/10.1093/bioinformatics/btn119</dc:identifier>
<dc:title><![CDATA[GeneTrack--a genomic data processing and visualization framework]]></dc:title>
<dc:publisher>Oxford University Press</dc:publisher>
<prism:number>10</prism:number>
<prism:volume>24</prism:volume>
<prism:endingPage>1306</prism:endingPage>
<prism:publicationDate>2008-05-15</prism:publicationDate>
<prism:startingPage>1305</prism:startingPage>
<prism:section>GENOME ANALYSIS</prism:section>
</item>

<item rdf:about="http://bioinformatics.oxfordjournals.org/cgi/content/short/24/10/1307?rss=1">
<title><![CDATA[CompariMotif: quick and easy comparisons of sequence motifs]]></title>
<link>http://bioinformatics.oxfordjournals.org/cgi/content/short/24/10/1307?rss=1</link>
<description><![CDATA[
<p><b>Summary:</b> CompariMotif is a novel tool for making motif&ndash;motif comparisons, identifying and describing similarities between regular expression motifs. CompariMotif can identify a number of different relationships between motifs, including exact matches, variants of degenerate motifs and complex overlapping motifs. Motif relationships are scored using shared information content, allowing the best matches to be easily identified in large comparisons. Many input and search options are available, enabling a list of motifs to be compared to itself (to identify recurring motifs) or to datasets of known motifs.</p>
<p><b>Availability:</b> CompariMotif can be run online at <inter-ref locator="http://bioware.ucd.ie/" locator-type="url">http://bioware.ucd.ie/</inter-ref> and is freely available for academic use as a set of open source Python modules under a GNU General Public License from <inter-ref locator="http://bioinformatics.ucd.ie/shields/software/comparimotif/" locator-type="url">http://bioinformatics.ucd.ie/shields/software/comparimotif/</inter-ref></p>
<p><b>Contact:</b>  <inter-ref locator="r.edwards@southampton.ac.uk" locator-type="email">r.edwards@southampton.ac.uk</inter-ref></p>
<p><b>Supplementary information:</b> Further details are available at <inter-ref locator="http://bioinformatics.ucd.ie/shields/software/comparimotif/" locator-type="url">http://bioinformatics.ucd.ie/shields/software/comparimotif/</inter-ref></p>
]]></description>
<dc:creator><![CDATA[Edwards, R. J., Davey, N. E., Shields, D. C.]]></dc:creator>
<dc:date>2008-05-07</dc:date>
<dc:identifier>info:doi/10.1093/bioinformatics/btn105</dc:identifier>
<dc:title><![CDATA[CompariMotif: quick and easy comparisons of sequence motifs]]></dc:title>
<dc:publisher>Oxford University Press</dc:publisher>
<prism:number>10</prism:number>
<prism:volume>24</prism:volume>
<prism:endingPage>1309</prism:endingPage>
<prism:publicationDate>2008-05-15</prism:publicationDate>
<prism:startingPage>1307</prism:startingPage>
<prism:section>SEQUENCE ANALYSIS</prism:section>
</item>

<item rdf:about="http://bioinformatics.oxfordjournals.org/cgi/content/short/24/10/1310?rss=1">
<title><![CDATA[MTMDAT: Automated analysis and visualization of mass spectrometry data for tertiary and quaternary structure probing of proteins]]></title>
<link>http://bioinformatics.oxfordjournals.org/cgi/content/short/24/10/1310?rss=1</link>
<description><![CDATA[
<p><b>Summary:</b> In structural biology and -genomics, nuclear magnetic resonance (NMR) spectroscopy and crystallography are the methods of choice, but sample requirements can be hard to fulfil. Valuable structural information can also be obtained by using a combination of limited proteolysis and mass spectrometry, providing not only knowledge of how to improve sample conditions for crystallization trials or NMR spectrosopy by gaining insight into subdomain identities but also probing tertiary and quaternary structure, folding and stability, ligand binding, protein interactions and the location of post-translational modifications. For high-throughput studies and larger proteins, however, this experimentally fast and easy approach produces considerable amounts of data, which until now has made the evaluation exceedingly laborious if at all manually possible. MTMDAT, equipped with a browser-like graphical user interface, accelerates this evaluation manifold by automated peak picking, assignment, data processing and visualization.</p>
<p><b>Availability:</b> MTMDAT can be downloaded from the following page: <inter-ref locator="http://www.cms.liu.se/chemistry/molbiotech/maria_sunnerhagens_group/mtmdat/" locator-type="url">http://www.cms.liu.se/chemistry/molbiotech/maria_sunnerhagens_group/mtmdat</inter-ref> by clicking on the corresponding links (windows- or unix-based) together with the manual and example files. The program is free for academic/non-commercial purposes only.</p>
<p><b>Contact:</b>  <inter-ref locator="janhe@ifm.liu.se" locator-type="email">janhe@ifm.liu.se</inter-ref></p>
]]></description>
<dc:creator><![CDATA[Hennig, J., Hennig, K. D. M., Sunnerhagen, M.]]></dc:creator>
<dc:date>2008-05-07</dc:date>
<dc:identifier>info:doi/10.1093/bioinformatics/btn116</dc:identifier>
<dc:title><![CDATA[MTMDAT: Automated analysis and visualization of mass spectrometry data for tertiary and quaternary structure probing of proteins]]></dc:title>
<dc:publisher>Oxford University Press</dc:publisher>
<prism:number>10</prism:number>
<prism:volume>24</prism:volume>
<prism:endingPage>1312</prism:endingPage>
<prism:publicationDate>2008-05-15</prism:publicationDate>
<prism:startingPage>1310</prism:startingPage>
<prism:section>STRUCTURAL BIOINFORMATICS</prism:section>
</item>

<item rdf:about="http://bioinformatics.oxfordjournals.org/cgi/content/short/24/10/1313?rss=1">
<title><![CDATA[FT-COMAR: fault tolerant three-dimensional structure reconstruction from protein contact maps]]></title>
<link>http://bioinformatics.oxfordjournals.org/cgi/content/short/24/10/1313?rss=1</link>
<description><![CDATA[
<p><b>Summary:</b> Fault Tolerant Contact Map Reconstruction <b>(</b>FT-COMAR) is a heuristic algorithm for the reconstruction of the protein three-dimensional structure from (possibly) incomplete (i.e. containing unknown entries) and noisy contact maps. FT-COMAR runs within minutes, allowing its application to a large-scale number of predictions.</p>
<p><b>Availability:</b> <inter-ref locator="http://bioinformatics.cs.unibo.it/FT-COMAR" locator-type="url">http://bioinformatics.cs.unibo.it/FT-COMAR</inter-ref></p>
<p><b>Contact:</b>  <inter-ref locator="vassura@cs.unibo.it" locator-type="email">vassura@cs.unibo.it</inter-ref></p>
<p><b>Supplementary information:</b> Supplementary data are available on <I>Bioinformatics</I> online.</p>
]]></description>
<dc:creator><![CDATA[Vassura, M., Margara, L., Di Lena, P., Medri, F., Fariselli, P., Casadio, R.]]></dc:creator>
<dc:date>2008-05-07</dc:date>
<dc:identifier>info:doi/10.1093/bioinformatics/btn115</dc:identifier>
<dc:title><![CDATA[FT-COMAR: fault tolerant three-dimensional structure reconstruction from protein contact maps]]></dc:title>
<dc:publisher>Oxford University Press</dc:publisher>
<prism:number>10</prism:number>
<prism:volume>24</prism:volume>
<prism:endingPage>1315</prism:endingPage>
<prism:publicationDate>2008-05-15</prism:publicationDate>
<prism:startingPage>1313</prism:startingPage>
<prism:section>STRUCTURAL BIOINFORMATICS</prism:section>
</item>

<item rdf:about="http://bioinformatics.oxfordjournals.org/cgi/content/short/24/10/1316?rss=1">
<title><![CDATA[siRNA specificity searching incorporating mismatch tolerance data]]></title>
<link>http://bioinformatics.oxfordjournals.org/cgi/content/short/24/10/1316?rss=1</link>
<description><![CDATA[
<p>Artificially synthesized short interfering RNAs (siRNAs) are widely used in functional genomics to knock down specific target genes. One ongoing challenge is to guarantee that the siRNA does not elicit off-target effects. Initial reports suggested that siRNAs were highly sequence-specific; however, subsequent data indicates that this is not necessarily the case. It is still uncertain what level of similarity and other rules are required for an off-target effect to be observed, and scoring schemes have not been developed to look beyond simple measures such as the number of mismatches or the number of consecutive matching bases present.</p>
<p>We created design rules for predicting the likelihood of a non-specific effect and present a web server that allows the user to check the specificity of a given siRNA in a flexible manner using a combination of methods. The server finds potential off-target matches in the corresponding RefSeq database and ranks them according to a scoring system based on experimental studies of specificity.</p>
<p><b>Availability:</b> The server is available at</p>
<p><inter-ref locator="http://informatics-eskitis.griffith.edu.au/SpecificityServer" locator-type="url">http://informatics-eskitis.griffith.edu.au/SpecificityServer</inter-ref>.</p>
<p><b>Contact:</b>  <inter-ref locator="Erik.Sonnhammer@sbc.su.se" locator-type="email">Erik.Sonnhammer@sbc.su.se</inter-ref></p>
<p><b>Supplementary information:</b> Supplementary analysis and figures are available at <I>Bioinformatics</I> online.</p>
]]></description>
<dc:creator><![CDATA[Chalk, A. M., Sonnhammer, E. L. L.]]></dc:creator>
<dc:date>2008-05-07</dc:date>
<dc:identifier>info:doi/10.1093/bioinformatics/btn121</dc:identifier>
<dc:title><![CDATA[siRNA specificity searching incorporating mismatch tolerance data]]></dc:title>
<dc:publisher>Oxford University Press</dc:publisher>
<prism:number>10</prism:number>
<prism:volume>24</prism:volume>
<prism:endingPage>1317</prism:endingPage>
<prism:publicationDate>2008-05-15</prism:publicationDate>
<prism:startingPage>1316</prism:startingPage>
<prism:section>GENE EXPRESSION</prism:section>
</item>

<item rdf:about="http://bioinformatics.oxfordjournals.org/cgi/content/short/24/10/1318?rss=1">
<title><![CDATA[A system for generating transcription regulatory networks with combinatorial control of transcription]]></title>
<link>http://bioinformatics.oxfordjournals.org/cgi/content/short/24/10/1318?rss=1</link>
<description><![CDATA[
<p><b>Summary:</b> We have developed a new software system, REgulatory Network generator with COmbinatorial control (RENCO), for automatic generation of differential equations describing pre-transcriptional combinatorics in artificial regulatory networks. RENCO has the following benefits: (a) it explicitly models protein&ndash;protein interactions among transcription factors, (b) it captures combinatorial control of transcription factors on target genes and (c) it produces output in Systems Biology Markup Language (SBML) format, which allows these equations to be directly imported into existing simulators. Explicit modeling of the protein interactions allows RENCO to incorporate greater mechanistic detail of the transcription machinery compared to existing models and can provide a better assessment of algorithms for regulatory network inference.</p>
<p><b>Availability:</b> RENCO is a C++ command line program, available at <inter-ref locator="http://sourceforge.net/projects/renco/" locator-type="url">http://sourceforge.net/projects/renco/</inter-ref></p>
<p><b>Contact:</b>  <inter-ref locator="terran@cs.unm.edu" locator-type="email">terran@cs.unm.edu</inter-ref></p>
<p><b>Supplementary information:</b> Supplementary data are available at <I>Bioinformatics</I> online.</p>
]]></description>
<dc:creator><![CDATA[Roy, S., Werner-Washburne, M., Lane, T.]]></dc:creator>
<dc:date>2008-05-07</dc:date>
<dc:identifier>info:doi/10.1093/bioinformatics/btn126</dc:identifier>
<dc:title><![CDATA[A system for generating transcription regulatory networks with combinatorial control of transcription]]></dc:title>
<dc:publisher>Oxford University Press</dc:publisher>
<prism:number>10</prism:number>
<prism:volume>24</prism:volume>
<prism:endingPage>1320</prism:endingPage>
<prism:publicationDate>2008-05-15</prism:publicationDate>
<prism:startingPage>1318</prism:startingPage>
<prism:section>SYSTEMS BIOLOGY</prism:section>
</item>

<item rdf:about="http://bioinformatics.oxfordjournals.org/cgi/content/short/24/10/1321?rss=1">
<title><![CDATA[UniProtJAPI: a remote API for accessing UniProt data]]></title>
<link>http://bioinformatics.oxfordjournals.org/cgi/content/short/24/10/1321?rss=1</link>
<description><![CDATA[
<p><b>Summary:</b> Programmatic access to the UniProt Knowledgebase (UniProtKB) is essential for many bioinformatics applications dealing with protein data. We have created a Java library named UniProtJAPI, which facilitates the integration of UniProt data into Java-based software applications. The library supports queries and similarity searches that return UniProtKB entries in the form of Java objects. These objects contain functional annotations or sequence information associated with a UniProt entry. Here, we briefly describe the UniProtJAPI and demonstrate its usage.</p>
<p><b>Availability:</b> <inter-ref locator="http://www.ebi.ac.uk/uniprot/remotingAPI" locator-type="url">http://www.ebi.ac.uk/uniprot/remotingAPI</inter-ref></p>
<p><b>Contact:</b>  <inter-ref locator="spatient@ebi.ac.uk" locator-type="email">spatient@ebi.ac.uk</inter-ref></p>
]]></description>
<dc:creator><![CDATA[Patient, S., Wieser, D., Kleen, M., Kretschmann, E., Jesus Martin, M., Apweiler, R.]]></dc:creator>
<dc:date>2008-05-07</dc:date>
<dc:identifier>info:doi/10.1093/bioinformatics/btn122</dc:identifier>
<dc:title><![CDATA[UniProtJAPI: a remote API for accessing UniProt data]]></dc:title>
<dc:publisher>Oxford University Press</dc:publisher>
<prism:number>10</prism:number>
<prism:volume>24</prism:volume>
<prism:endingPage>1322</prism:endingPage>
<prism:publicationDate>2008-05-15</prism:publicationDate>
<prism:startingPage>1321</prism:startingPage>
<prism:section>DATABASES AND ONTOLOGIES</prism:section>
</item>

<item rdf:about="http://bioinformatics.oxfordjournals.org/cgi/content/short/24/10/1323?rss=1">
<title><![CDATA[PGMapper: a web-based tool linking phenotype to genes]]></title>
<link>http://bioinformatics.oxfordjournals.org/cgi/content/short/24/10/1323?rss=1</link>
<description><![CDATA[]]></description>
<dc:creator><![CDATA[Xiong, Q., Qiu, Y., Gu, W.]]></dc:creator>
<dc:date>2008-05-07</dc:date>
<dc:identifier>info:doi/10.1093/bioinformatics/btn124</dc:identifier>
<dc:title><![CDATA[PGMapper: a web-based tool linking phenotype to genes]]></dc:title>
<dc:publisher>Oxford University Press</dc:publisher>
<prism:number>10</prism:number>
<prism:volume>24</prism:volume>
<prism:endingPage>1323</prism:endingPage>
<prism:publicationDate>2008-05-15</prism:publicationDate>
<prism:startingPage>1323</prism:startingPage>
<prism:section>CORRIGENDUM</prism:section>
</item>

</rdf:RDF>