<?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://bib.oxfordjournals.org">
<title>Briefings in Bioinformatics - current issue</title>
<link>http://bib.oxfordjournals.org</link>
<description>Briefings in Bioinformatics - RSS feed of current issue</description>
<prism:eIssn>1477-4054</prism:eIssn>
<prism:coverDisplayDate>September 2008</prism:coverDisplayDate>
<prism:publicationName>Briefings in Bioinformatics</prism:publicationName>
<prism:issn>1467-5463</prism:issn>
<items>
 <rdf:Seq>
  <rdf:li rdf:resource="http://bib.oxfordjournals.org/cgi/content/short/9/5/345?rss=1" />
  <rdf:li rdf:resource="http://bib.oxfordjournals.org/cgi/content/short/9/5/355?rss=1" />
  <rdf:li rdf:resource="http://bib.oxfordjournals.org/cgi/content/short/9/5/367?rss=1" />
  <rdf:li rdf:resource="http://bib.oxfordjournals.org/cgi/content/short/9/5/376?rss=1" />
  <rdf:li rdf:resource="http://bib.oxfordjournals.org/cgi/content/short/9/5/392?rss=1" />
  <rdf:li rdf:resource="http://bib.oxfordjournals.org/cgi/content/short/9/5/404?rss=1" />
  <rdf:li rdf:resource="http://bib.oxfordjournals.org/cgi/content/short/9/5/422?rss=1" />
  <rdf:li rdf:resource="http://bib.oxfordjournals.org/cgi/content/short/9/5/437?rss=1" />
  <rdf:li rdf:resource="http://bib.oxfordjournals.org/cgi/content/short/9/5/450?rss=1" />
 </rdf:Seq>
</items>
</channel>

<item rdf:about="http://bib.oxfordjournals.org/cgi/content/short/9/5/345?rss=1">
<title><![CDATA[Biodiversity informatics: the challenge of linking data and the role of shared identifiers]]></title>
<link>http://bib.oxfordjournals.org/cgi/content/short/9/5/345?rss=1</link>
<description><![CDATA[
<p>A major challenge facing biodiversity informatics is integrating data stored in widely distributed databases. Initial efforts have relied on taxonomic names as the shared identifier linking records in different databases. However, taxonomic names have limitations as identifiers, being neither stable nor globally unique, and the pace of molecular taxonomic and phylogenetic research means that a lot of information in public sequence databases is not linked to formal taxonomic names. This review explores the use of other identifiers, such as specimen codes and GenBank accession numbers, to link otherwise disconnected facts in different databases. The structure of these links can also be exploited using the PageRank algorithm to rank the results of searches on biodiversity databases. The key to rich integration is a commitment to deploy and reuse globally unique, shared identifiers [such as Digital Object Identifiers (DOIs) and Life Science Identifiers (LSIDs)], and the implementation of services that link those identifiers.</p>
]]></description>
<dc:creator><![CDATA[Page, R. D. M.]]></dc:creator>
<dc:date>2008-08-13</dc:date>
<dc:identifier>info:doi/10.1093/bib/bbn022</dc:identifier>
<dc:title><![CDATA[Biodiversity informatics: the challenge of linking data and the role of shared identifiers]]></dc:title>
<dc:publisher>Oxford University Press</dc:publisher>
<prism:number>5</prism:number>
<prism:volume>9</prism:volume>
<prism:endingPage>354</prism:endingPage>
<prism:publicationDate>2008-09-01</prism:publicationDate>
<prism:startingPage>345</prism:startingPage>
<prism:section>Papers</prism:section>
</item>

<item rdf:about="http://bib.oxfordjournals.org/cgi/content/short/9/5/355?rss=1">
<title><![CDATA[Detecting short tandem repeats from genome data: opening the software black box]]></title>
<link>http://bib.oxfordjournals.org/cgi/content/short/9/5/355?rss=1</link>
<description><![CDATA[
<p>Short tandem repeats, specifically microsatellites, are widely used genetic markers, associated with human genetic diseases, and play an important role in various regulatory mechanisms and evolution. Despite their importance, much is yet unknown about their mutational dynamics. The increasing availability of genome data has led to several <I>in silico</I> studies of microsatellite evolution which have produced a vast range of algorithms and software for tandem repeat detection. Documentation of these tools is often sparse, or provided in a format that is impenetrable to most biologists without informatics background. This article introduces the major concepts behind repeat detecting software essential for informed tool selection. We reflect on issues such as parameter settings and program bias, as well as redundancy filtering and efficiency using examples from the currently available range of programs, to provide an integrated comparison and practical guide to microsatellite detecting programs.</p>
]]></description>
<dc:creator><![CDATA[Merkel, A., Gemmell, N.]]></dc:creator>
<dc:date>2008-08-13</dc:date>
<dc:identifier>info:doi/10.1093/bib/bbn028</dc:identifier>
<dc:title><![CDATA[Detecting short tandem repeats from genome data: opening the software black box]]></dc:title>
<dc:publisher>Oxford University Press</dc:publisher>
<prism:number>5</prism:number>
<prism:volume>9</prism:volume>
<prism:endingPage>366</prism:endingPage>
<prism:publicationDate>2008-09-01</prism:publicationDate>
<prism:startingPage>355</prism:startingPage>
<prism:section>Papers</prism:section>
</item>

<item rdf:about="http://bib.oxfordjournals.org/cgi/content/short/9/5/367?rss=1">
<title><![CDATA[The relative value of operon predictions]]></title>
<link>http://bib.oxfordjournals.org/cgi/content/short/9/5/367?rss=1</link>
<description><![CDATA[
<p>For most organisms, computational operon predictions are the only source of genome-wide operon information. Operon prediction methods described in literature are based on (a combination of) the following five criteria: (i) intergenic distance, (ii) conserved gene clusters, (iii) functional relation, (iv) sequence elements and (v) experimental evidence. The performance estimates of operon predictions reported in literature cannot directly be compared due to differences in methods and data used in these studies. Here, we survey the current status of operon prediction methods. Based on a comparison of the performance of operon predictions on <I>Escherichia coli</I> and <I>Bacillus subtilis</I> we conclude that there is still room for improvement. We expect that existing and newly generated genomics and transcriptomics data will further improve accuracy of operon prediction methods.</p>
]]></description>
<dc:creator><![CDATA[Brouwer, R. W. W., Kuipers, O. P., van Hijum, S. A. F. T.]]></dc:creator>
<dc:date>2008-08-13</dc:date>
<dc:identifier>info:doi/10.1093/bib/bbn019</dc:identifier>
<dc:title><![CDATA[The relative value of operon predictions]]></dc:title>
<dc:publisher>Oxford University Press</dc:publisher>
<prism:number>5</prism:number>
<prism:volume>9</prism:volume>
<prism:endingPage>375</prism:endingPage>
<prism:publicationDate>2008-09-01</prism:publicationDate>
<prism:startingPage>367</prism:startingPage>
<prism:section>Papers</prism:section>
</item>

<item rdf:about="http://bib.oxfordjournals.org/cgi/content/short/9/5/376?rss=1">
<title><![CDATA[Identification of replication origins in prokaryotic genomes]]></title>
<link>http://bib.oxfordjournals.org/cgi/content/short/9/5/376?rss=1</link>
<description><![CDATA[
<p>The availability of hundreds of complete bacterial genomes has created new challenges and simultaneously opportunities for bioinformatics. In the area of statistical analysis of genomic sequences, the studies of nucleotide compositional bias and gene bias between strands and replichores paved way to the development of tools for prediction of bacterial replication origins. Only a few (about 20) origin regions for eubacteria and archaea have been proven experimentally. One reason for that may be that this is now considered as an essentially bioinformatics problem, where predictions are sufficiently reliable not to run labor-intensive experiments, unless specifically needed. Here we describe the main existing approaches to the identification of replication origin (<I>oriC</I>) and termination (<I>terC</I>) loci in prokaryotic chromosomes and characterize a number of computational tools based on various skew types and other types of evidence. We also classify the eubacterial and archaeal chromosomes by predictability of their replication origins using skew plots. Finally, we discuss possible combined approaches to the identification of the <I>oriC</I> sites that may be used to improve the prediction tools, in particular, the analysis of DnaA binding sites using the comparative genomic methods.</p>
]]></description>
<dc:creator><![CDATA[Sernova, N. V., Gelfand, M. S.]]></dc:creator>
<dc:date>2008-08-13</dc:date>
<dc:identifier>info:doi/10.1093/bib/bbn031</dc:identifier>
<dc:title><![CDATA[Identification of replication origins in prokaryotic genomes]]></dc:title>
<dc:publisher>Oxford University Press</dc:publisher>
<prism:number>5</prism:number>
<prism:volume>9</prism:volume>
<prism:endingPage>391</prism:endingPage>
<prism:publicationDate>2008-09-01</prism:publicationDate>
<prism:startingPage>376</prism:startingPage>
<prism:section>Papers</prism:section>
</item>

<item rdf:about="http://bib.oxfordjournals.org/cgi/content/short/9/5/392?rss=1">
<title><![CDATA[Penalized feature selection and classification in bioinformatics]]></title>
<link>http://bib.oxfordjournals.org/cgi/content/short/9/5/392?rss=1</link>
<description><![CDATA[
<p>In bioinformatics studies, supervised classification with high-dimensional input variables is frequently encountered. Examples routinely arise in genomic, epigenetic and proteomic studies. Feature selection can be employed along with classifier construction to avoid over-fitting, to generate more reliable classifier and to provide more insights into the underlying causal relationships. In this article, we provide a review of several recently developed penalized feature selection and classification techniques&mdash;which belong to the family of embedded feature selection methods&mdash;for bioinformatics studies with high-dimensional input. Classification objective functions, penalty functions and computational algorithms are discussed. Our goal is to make interested researchers aware of these feature selection and classification methods that are applicable to high-dimensional bioinformatics data.</p>
]]></description>
<dc:creator><![CDATA[Ma, S., Huang, J.]]></dc:creator>
<dc:date>2008-08-13</dc:date>
<dc:identifier>info:doi/10.1093/bib/bbn027</dc:identifier>
<dc:title><![CDATA[Penalized feature selection and classification in bioinformatics]]></dc:title>
<dc:publisher>Oxford University Press</dc:publisher>
<prism:number>5</prism:number>
<prism:volume>9</prism:volume>
<prism:endingPage>403</prism:endingPage>
<prism:publicationDate>2008-09-01</prism:publicationDate>
<prism:startingPage>392</prism:startingPage>
<prism:section>Papers</prism:section>
</item>

<item rdf:about="http://bib.oxfordjournals.org/cgi/content/short/9/5/404?rss=1">
<title><![CDATA[A structured approach for the engineering of biochemical network models, illustrated for signalling pathways]]></title>
<link>http://bib.oxfordjournals.org/cgi/content/short/9/5/404?rss=1</link>
<description><![CDATA[
<p>Quantitative models of biochemical networks (signal transduction cascades, metabolic pathways, gene regulatory circuits) are a central component of modern systems biology. Building and managing these complex models is a major challenge that can benefit from the application of formal methods adopted from theoretical computing science. Here we provide a general introduction to the field of formal modelling, which emphasizes the intuitive biochemical basis of the modelling process, but is also accessible for an audience with a background in computing science and/or model engineering. We show how signal transduction cascades can be modelled in a modular fashion, using both a qualitative approach&mdash;qualitative Petri nets, and quantitative approaches&mdash;continuous Petri nets and ordinary differential equations (ODEs). We review the major elementary building blocks of a cellular signalling model, discuss which critical design decisions have to be made during model building, and present a number of novel computational tools that can help to explore alternative modular models in an easy and intuitive manner. These tools, which are based on Petri net theory, offer convenient ways of composing hierarchical ODE models, and permit a qualitative analysis of their behaviour. We illustrate the central concepts using signal transduction as our main example. The ultimate aim is to introduce a general approach that provides the foundations for a structured formal engineering of large-scale models of biochemical networks.</p>
]]></description>
<dc:creator><![CDATA[Breitling, R., Gilbert, D., Heiner, M., Orton, R.]]></dc:creator>
<dc:date>2008-08-13</dc:date>
<dc:identifier>info:doi/10.1093/bib/bbn026</dc:identifier>
<dc:title><![CDATA[A structured approach for the engineering of biochemical network models, illustrated for signalling pathways]]></dc:title>
<dc:publisher>Oxford University Press</dc:publisher>
<prism:number>5</prism:number>
<prism:volume>9</prism:volume>
<prism:endingPage>421</prism:endingPage>
<prism:publicationDate>2008-09-01</prism:publicationDate>
<prism:startingPage>404</prism:startingPage>
<prism:section>Papers</prism:section>
</item>

<item rdf:about="http://bib.oxfordjournals.org/cgi/content/short/9/5/422?rss=1">
<title><![CDATA[A critical examination of stoichiometric and path-finding approaches to metabolic pathways]]></title>
<link>http://bib.oxfordjournals.org/cgi/content/short/9/5/422?rss=1</link>
<description><![CDATA[
<p>Advances in the field of genomics have enabled computational analysis of metabolic pathways at the genome scale. Singular attention has been devoted in the literature to stoichiometric approaches, and path-finding approaches, to metabolic pathways. Stoichiometric approaches make use of reaction stoichiometry when trying to determine metabolic pathways. Stoichiometric approaches involve elementary flux modes and extreme pathways. In contrast, path-finding approaches propose an alternative view based on graph theory in which reaction stoichiometry is not considered. Path-finding approaches use shortest path and <I>k</I>-shortest path concepts. In this article we give a critical overview of the theory, applications and key research challenges of stoichiometric and path-finding approaches to metabolic pathways.</p>
]]></description>
<dc:creator><![CDATA[Planes, F. J., Beasley, J. E.]]></dc:creator>
<dc:date>2008-08-13</dc:date>
<dc:identifier>info:doi/10.1093/bib/bbn018</dc:identifier>
<dc:title><![CDATA[A critical examination of stoichiometric and path-finding approaches to metabolic pathways]]></dc:title>
<dc:publisher>Oxford University Press</dc:publisher>
<prism:number>5</prism:number>
<prism:volume>9</prism:volume>
<prism:endingPage>436</prism:endingPage>
<prism:publicationDate>2008-09-01</prism:publicationDate>
<prism:startingPage>422</prism:startingPage>
<prism:section>Papers</prism:section>
</item>

<item rdf:about="http://bib.oxfordjournals.org/cgi/content/short/9/5/437?rss=1">
<title><![CDATA[The Beta Workbench: a computational tool to study the dynamics of biological systems]]></title>
<link>http://bib.oxfordjournals.org/cgi/content/short/9/5/437?rss=1</link>
<description><![CDATA[
<p>We introduce the Beta Workbench (BWB), a scalable tool built on top of the newly defined BlenX language to model, simulate and analyse biological systems. We show the features and the incremental modelling process supported by the BWB on a running example based on the mitogen-activated kinase pathway. Finally, we provide a comparison with related approaches and some hints for future extensions.</p>
]]></description>
<dc:creator><![CDATA[Dematte, L., Priami, C., Romanel, A.]]></dc:creator>
<dc:date>2008-08-13</dc:date>
<dc:identifier>info:doi/10.1093/bib/bbn023</dc:identifier>
<dc:title><![CDATA[The Beta Workbench: a computational tool to study the dynamics of biological systems]]></dc:title>
<dc:publisher>Oxford University Press</dc:publisher>
<prism:number>5</prism:number>
<prism:volume>9</prism:volume>
<prism:endingPage>449</prism:endingPage>
<prism:publicationDate>2008-09-01</prism:publicationDate>
<prism:startingPage>437</prism:startingPage>
<prism:section>Papers</prism:section>
</item>

<item rdf:about="http://bib.oxfordjournals.org/cgi/content/short/9/5/450?rss=1">
<title><![CDATA[Gene-set approach for expression pattern analysis]]></title>
<link>http://bib.oxfordjournals.org/cgi/content/short/9/5/450?rss=1</link>
<description><![CDATA[]]></description>
<dc:creator><![CDATA[Nam, D., Kim, S.-Y.]]></dc:creator>
<dc:date>2008-08-13</dc:date>
<dc:identifier>info:doi/10.1093/bib/bbn030</dc:identifier>
<dc:title><![CDATA[Gene-set approach for expression pattern analysis]]></dc:title>
<dc:publisher>Oxford University Press</dc:publisher>
<prism:number>5</prism:number>
<prism:volume>9</prism:volume>
<prism:endingPage>450</prism:endingPage>
<prism:publicationDate>2008-09-01</prism:publicationDate>
<prism:startingPage>450</prism:startingPage>
<prism:section>Erratum</prism:section>
</item>

</rdf:RDF>