<?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 - recent issues</title>
<link>http://bib.oxfordjournals.org</link>
<description>Briefings in Bioinformatics - RSS feed of recent issues (covers the latest 3 issues, including the current issue) </description>
<prism:eIssn>1477-4054</prism:eIssn>
<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/10/6/593?rss=1" />
  <rdf:li rdf:resource="http://bib.oxfordjournals.org/cgi/content/short/10/6/595?rss=1" />
  <rdf:li rdf:resource="http://bib.oxfordjournals.org/cgi/content/short/10/6/609?rss=1" />
  <rdf:li rdf:resource="http://bib.oxfordjournals.org/cgi/content/short/10/6/619?rss=1" />
  <rdf:li rdf:resource="http://bib.oxfordjournals.org/cgi/content/short/10/6/631?rss=1" />
  <rdf:li rdf:resource="http://bib.oxfordjournals.org/cgi/content/short/10/6/645?rss=1" />
  <rdf:li rdf:resource="http://bib.oxfordjournals.org/cgi/content/short/10/6/654?rss=1" />
  <rdf:li rdf:resource="http://bib.oxfordjournals.org/cgi/content/short/10/6/664?rss=1" />
  <rdf:li rdf:resource="http://bib.oxfordjournals.org/cgi/content/short/10/6/676?rss=1" />
  <rdf:li rdf:resource="http://bib.oxfordjournals.org/cgi/content/short/10/5/475?rss=1" />
  <rdf:li rdf:resource="http://bib.oxfordjournals.org/cgi/content/short/10/5/490?rss=1" />
  <rdf:li rdf:resource="http://bib.oxfordjournals.org/cgi/content/short/10/5/498?rss=1" />
  <rdf:li rdf:resource="http://bib.oxfordjournals.org/cgi/content/short/10/5/509?rss=1" />
  <rdf:li rdf:resource="http://bib.oxfordjournals.org/cgi/content/short/10/5/525?rss=1" />
  <rdf:li rdf:resource="http://bib.oxfordjournals.org/cgi/content/short/10/5/537?rss=1" />
  <rdf:li rdf:resource="http://bib.oxfordjournals.org/cgi/content/short/10/5/547?rss=1" />
  <rdf:li rdf:resource="http://bib.oxfordjournals.org/cgi/content/short/10/5/556?rss=1" />
  <rdf:li rdf:resource="http://bib.oxfordjournals.org/cgi/content/short/10/5/569?rss=1" />
  <rdf:li rdf:resource="http://bib.oxfordjournals.org/cgi/content/short/10/5/579?rss=1" />
  <rdf:li rdf:resource="http://bib.oxfordjournals.org/cgi/content/short/10/4/343?rss=1" />
  <rdf:li rdf:resource="http://bib.oxfordjournals.org/cgi/content/short/10/4/345?rss=1" />
  <rdf:li rdf:resource="http://bib.oxfordjournals.org/cgi/content/short/10/4/354?rss=1" />
  <rdf:li rdf:resource="http://bib.oxfordjournals.org/cgi/content/short/10/4/367?rss=1" />
  <rdf:li rdf:resource="http://bib.oxfordjournals.org/cgi/content/short/10/4/378?rss=1" />
  <rdf:li rdf:resource="http://bib.oxfordjournals.org/cgi/content/short/10/4/392?rss=1" />
  <rdf:li rdf:resource="http://bib.oxfordjournals.org/cgi/content/short/10/4/408?rss=1" />
  <rdf:li rdf:resource="http://bib.oxfordjournals.org/cgi/content/short/10/4/424?rss=1" />
  <rdf:li rdf:resource="http://bib.oxfordjournals.org/cgi/content/short/10/4/435?rss=1" />
  <rdf:li rdf:resource="http://bib.oxfordjournals.org/cgi/content/short/10/4/450?rss=1" />
  <rdf:li rdf:resource="http://bib.oxfordjournals.org/cgi/content/short/10/4/462?rss=1" />
 </rdf:Seq>
</items>
</channel>

<item rdf:about="http://bib.oxfordjournals.org/cgi/content/short/10/6/593?rss=1">
<title><![CDATA[Editorial]]></title>
<link>http://bib.oxfordjournals.org/cgi/content/short/10/6/593?rss=1</link>
<description><![CDATA[]]></description>
<dc:creator><![CDATA[Dicks, J.]]></dc:creator>
<dc:date>Fri, 20 Nov 2009 07:05:02 PST</dc:date>
<dc:identifier>info:doi/10.1093/bib/bbp052</dc:identifier>
<dc:title><![CDATA[Editorial]]></dc:title>
<dc:publisher>Oxford University Press</dc:publisher>
<prism:number>6</prism:number>
<prism:volume>10</prism:volume>
<prism:endingPage>594</prism:endingPage>
<prism:publicationDate>2009-11-01</prism:publicationDate>
<prism:startingPage>593</prism:startingPage>
<prism:section>Editorial</prism:section>
</item>

<item rdf:about="http://bib.oxfordjournals.org/cgi/content/short/10/6/595?rss=1">
<title><![CDATA[Computational approaches and software tools for genetic linkage map estimation in plants]]></title>
<link>http://bib.oxfordjournals.org/cgi/content/short/10/6/595?rss=1</link>
<description><![CDATA[
<p>Genetic maps are an important component within the plant biologist's toolkit, underpinning crop plant improvement programs. The estimation of plant genetic maps is a conceptually simple yet computationally complex problem, growing ever more so with the development of inexpensive, high-throughput DNA markers. The challenge for bioinformaticians is to develop analytical methods and accompanying software tools that can cope with datasets of differing sizes, from tens to thousands of markers, that can incorporate the expert knowledge that plant biologists typically use when developing their maps, and that facilitate user-friendly approaches to achieving these goals. Here, we aim to give a flavour of computational approaches for genetic map estimation, discussing briefly many of the key concepts involved, and describing a selection of software tools that employ them. This review is intended both for plant geneticists as an introduction to software tools with which to estimate genetic maps, and for bioinformaticians as an introduction to the underlying computational approaches.</p>
]]></description>
<dc:creator><![CDATA[Cheema, J., Dicks, J.]]></dc:creator>
<dc:date>Fri, 20 Nov 2009 07:05:02 PST</dc:date>
<dc:identifier>info:doi/10.1093/bib/bbp045</dc:identifier>
<dc:title><![CDATA[Computational approaches and software tools for genetic linkage map estimation in plants]]></dc:title>
<dc:publisher>Oxford University Press</dc:publisher>
<prism:number>6</prism:number>
<prism:volume>10</prism:volume>
<prism:endingPage>608</prism:endingPage>
<prism:publicationDate>2009-11-01</prism:publicationDate>
<prism:startingPage>595</prism:startingPage>
<prism:section>Papers</prism:section>
</item>

<item rdf:about="http://bib.oxfordjournals.org/cgi/content/short/10/6/609?rss=1">
<title><![CDATA[De novo sequencing of plant genomes using second-generation technologies]]></title>
<link>http://bib.oxfordjournals.org/cgi/content/short/10/6/609?rss=1</link>
<description><![CDATA[
<p>The ability to sequence the DNA of an organism has become one of the most important tools in modern biological research. Until recently, the sequencing of even small model genomes required substantial funds and international collaboration. The development of &lsquo;second-generation&rsquo; sequencing technology has increased the throughput and reduced the cost of sequence generation by several orders of magnitude. These new methods produce vast numbers of relatively short reads, usually at the expense of read accuracy. Since the first commercial second-generation sequencing system was produced by 454 Technologies and commercialised by Roche, several other companies including Illumina, Applied Biosystems, Helicos Biosciences and Pacific Biosciences have joined the competition. Because of the relatively high error rate and lack of assembly tools, short-read sequence technology has mainly been applied to the re-sequencing of genomes. However, some recent applications have focused on the <I>de novo</I> assembly of these data. <I>De novo</I> assembly remains the greatest challenge for DNA sequencing and there are specific problems for second generation sequencing which produces short reads with a high error rate. However, a number of different approaches for short-read assembly have been proposed and some have been implemented in working software. In this review, we compare the current approaches for second-generation genome sequencing, explore the future direction of this technology and the implications for plant genome research.</p>
]]></description>
<dc:creator><![CDATA[Imelfort, M., Edwards, D.]]></dc:creator>
<dc:date>Fri, 20 Nov 2009 07:05:02 PST</dc:date>
<dc:identifier>info:doi/10.1093/bib/bbp039</dc:identifier>
<dc:title><![CDATA[De novo sequencing of plant genomes using second-generation technologies]]></dc:title>
<dc:publisher>Oxford University Press</dc:publisher>
<prism:number>6</prism:number>
<prism:volume>10</prism:volume>
<prism:endingPage>618</prism:endingPage>
<prism:publicationDate>2009-11-01</prism:publicationDate>
<prism:startingPage>609</prism:startingPage>
<prism:section>Papers</prism:section>
</item>

<item rdf:about="http://bib.oxfordjournals.org/cgi/content/short/10/6/619?rss=1">
<title><![CDATA[Improved criteria and comparative genomics tool provide new insights into grass paleogenomics]]></title>
<link>http://bib.oxfordjournals.org/cgi/content/short/10/6/619?rss=1</link>
<description><![CDATA[
<p>In the past decade, a number of bioinformatics tools have been developed to perform comparative genomics studies in plants and animals. However, most of the publicly available and user friendly tools lack common standards for the identification of robust orthologous relationships between genomes leading non-specialists to often over interpret the results of large scale comparative sequence analyses. Recently, we have established a number of improved parameters and tools to define significant relationships between genomes as a basis to develop paleogenomics studies in grasses. Here, we describe our approaches and propose the development of community-based standards that can be used in comparative genomic studies to (i) identify robust sets of orthologous gene pairs, (ii) derive complete sets of chromosome to chromosome relationships within and between genomes and (iii) model common paleo-ancestor genome structures. The rice and sorghum genome sequences are used to exemplify step-by-step a methodology that should allow users to perform accurate comparative genome analyses in their favourite species. Finally, we describe two applications for accurate gene annotation and synteny-based cloning of agronomically important traits.</p>
]]></description>
<dc:creator><![CDATA[Salse, J., Abrouk, M., Murat, F., Quraishi, U. M., Feuillet, C.]]></dc:creator>
<dc:date>Fri, 20 Nov 2009 07:05:02 PST</dc:date>
<dc:identifier>info:doi/10.1093/bib/bbp037</dc:identifier>
<dc:title><![CDATA[Improved criteria and comparative genomics tool provide new insights into grass paleogenomics]]></dc:title>
<dc:publisher>Oxford University Press</dc:publisher>
<prism:number>6</prism:number>
<prism:volume>10</prism:volume>
<prism:endingPage>630</prism:endingPage>
<prism:publicationDate>2009-11-01</prism:publicationDate>
<prism:startingPage>619</prism:startingPage>
<prism:section>Papers</prism:section>
</item>

<item rdf:about="http://bib.oxfordjournals.org/cgi/content/short/10/6/631?rss=1">
<title><![CDATA[Common introns within orthologous genes: software and application to plants]]></title>
<link>http://bib.oxfordjournals.org/cgi/content/short/10/6/631?rss=1</link>
<description><![CDATA[
<p>The residence of spliceosomal introns within protein-coding genes can fluctuate over time, with genes gaining, losing or conserving introns in a complex process that is not entirely understood. One approach for studying intron evolution is to compare introns with respect to position and type within closely related genes. Here, we describe new, freely available software called Common Introns Within Orthologous Genes (CIWOG), available at <inter-ref locator="http://ciwog.gdcb.iastate.edu/," locator-type="url">http://ciwog.gdcb.iastate.edu/,</inter-ref> which detects common introns in protein-coding genes based on position and sequence conservation in the corresponding protein alignments. CIWOG provides dynamic web displays that facilitate detailed intron studies within orthologous genes. User-supplied options control how introns are clustered into sets of common introns. CIWOG also identifies special classes of introns, in particular those with GC- or U12-type donor sites, which enables analyses of these introns in relation to their counterparts in the other genes in orthologous groups. The software is demonstrated with application to a comprehensive study of eight plant transcriptomes. Three specific examples are discussed: intron class conversion from GT- to GC-donor-type introns in monocots, plant U12-type intron conservation and a global analysis of intron evolution across the eight plant species.</p>
]]></description>
<dc:creator><![CDATA[Wilkerson, M. D., Ru, Y., Brendel, V. P.]]></dc:creator>
<dc:date>Fri, 20 Nov 2009 07:05:02 PST</dc:date>
<dc:identifier>info:doi/10.1093/bib/bbp051</dc:identifier>
<dc:title><![CDATA[Common introns within orthologous genes: software and application to plants]]></dc:title>
<dc:publisher>Oxford University Press</dc:publisher>
<prism:number>6</prism:number>
<prism:volume>10</prism:volume>
<prism:endingPage>644</prism:endingPage>
<prism:publicationDate>2009-11-01</prism:publicationDate>
<prism:startingPage>631</prism:startingPage>
<prism:section>Papers</prism:section>
</item>

<item rdf:about="http://bib.oxfordjournals.org/cgi/content/short/10/6/645?rss=1">
<title><![CDATA[Bioinformatics in the orphan crops]]></title>
<link>http://bib.oxfordjournals.org/cgi/content/short/10/6/645?rss=1</link>
<description><![CDATA[
<p>Orphan crops are those which are grown as food, animal feed or other crops of some importance in agriculture, but which have not yet received the investment of research effort or funding required to develop significant public bioinformatics resources. Where an orphan crop is related to a well-characterised model plant species, comparative genomics and bioinformatics can often, though not always, be exploited to assist research and crop improvement. This review addresses some challenges and opportunities presented by bioinformatics in the orphan crops, using three examples: forage grasses from the genera <I>Lolium</I> and <I>Festuca</I>, forage legumes and the second generation energy crop <I>Miscanthus</I>.</p>
]]></description>
<dc:creator><![CDATA[Armstead, I., Huang, L., Ravagnani, A., Robson, P., Ougham, H.]]></dc:creator>
<dc:date>Fri, 20 Nov 2009 07:05:02 PST</dc:date>
<dc:identifier>info:doi/10.1093/bib/bbp036</dc:identifier>
<dc:title><![CDATA[Bioinformatics in the orphan crops]]></dc:title>
<dc:publisher>Oxford University Press</dc:publisher>
<prism:number>6</prism:number>
<prism:volume>10</prism:volume>
<prism:endingPage>653</prism:endingPage>
<prism:publicationDate>2009-11-01</prism:publicationDate>
<prism:startingPage>645</prism:startingPage>
<prism:section>Papers</prism:section>
</item>

<item rdf:about="http://bib.oxfordjournals.org/cgi/content/short/10/6/654?rss=1">
<title><![CDATA[Computational techniques for elucidating plant-pathogen interactions from large-scale experiments on fungi and oomycetes]]></title>
<link>http://bib.oxfordjournals.org/cgi/content/short/10/6/654?rss=1</link>
<description><![CDATA[
<p>Eukaryotic plant pathogens are responsible for the destruction of billions of dollars worth of crops each year. With large-scale genomics of both pathogens and hosts and the corresponding computational analysis, biologists are now able to gain knowledge about many pathogenic and defense genes concurrently. To study the interactions between these two organism groups, it is necessary to design experiments to elucidate the genes being expressed during the invasion of the pathogen into the host. For the most part, this does not require new software development, though it does require the use of existing software in novel ways. This article provides a broad overview of several key and illustrative experiments and the corresponding computational analyses, outlining the knowledge gained in each. It goes on to describe databases for plant&ndash;pathogen data and important initiatives such as Plant-Associated Microbe Gene Ontology. It discusses how various emerging approaches will increase the power of computers in host-pathogen interaction studies.</p>
]]></description>
<dc:creator><![CDATA[Soderlund, C.]]></dc:creator>
<dc:date>Fri, 20 Nov 2009 07:05:03 PST</dc:date>
<dc:identifier>info:doi/10.1093/bib/bbp053</dc:identifier>
<dc:title><![CDATA[Computational techniques for elucidating plant-pathogen interactions from large-scale experiments on fungi and oomycetes]]></dc:title>
<dc:publisher>Oxford University Press</dc:publisher>
<prism:number>6</prism:number>
<prism:volume>10</prism:volume>
<prism:endingPage>663</prism:endingPage>
<prism:publicationDate>2009-11-01</prism:publicationDate>
<prism:startingPage>654</prism:startingPage>
<prism:section>Papers</prism:section>
</item>

<item rdf:about="http://bib.oxfordjournals.org/cgi/content/short/10/6/664?rss=1">
<title><![CDATA[Software engineering the mixed model for genome-wide association studies on large samples]]></title>
<link>http://bib.oxfordjournals.org/cgi/content/short/10/6/664?rss=1</link>
<description><![CDATA[
<p>Mixed models improve the ability to detect phenotype-genotype associations in the presence of population stratification and multiple levels of relatedness in genome-wide association studies (GWAS), but for large data sets the resource consumption becomes impractical. At the same time, the sample size and number of markers used for GWAS is increasing dramatically, resulting in greater statistical power to detect those associations. The use of mixed models with increasingly large data sets depends on the availability of software for analyzing those models. While multiple software packages implement the mixed model method, no single package provides the best combination of fast computation, ability to handle large samples, flexible modeling and ease of use. Key elements of association analysis with mixed models are reviewed, including modeling phenotype-genotype associations using mixed models, population stratification, kinship and its estimation, variance component estimation, use of best linear unbiased predictors or residuals in place of raw phenotype, improving efficiency and software&ndash;user interaction. The available software packages are evaluated, and suggestions made for future software development.</p>
]]></description>
<dc:creator><![CDATA[Zhang, Z., Buckler, E. S., Casstevens, T. M., Bradbury, P. J.]]></dc:creator>
<dc:date>Fri, 20 Nov 2009 07:05:03 PST</dc:date>
<dc:identifier>info:doi/10.1093/bib/bbp050</dc:identifier>
<dc:title><![CDATA[Software engineering the mixed model for genome-wide association studies on large samples]]></dc:title>
<dc:publisher>Oxford University Press</dc:publisher>
<prism:number>6</prism:number>
<prism:volume>10</prism:volume>
<prism:endingPage>675</prism:endingPage>
<prism:publicationDate>2009-11-01</prism:publicationDate>
<prism:startingPage>664</prism:startingPage>
<prism:section>Papers</prism:section>
</item>

<item rdf:about="http://bib.oxfordjournals.org/cgi/content/short/10/6/676?rss=1">
<title><![CDATA[Data integration for plant genomics--exemplars from the integration of Arabidopsis thaliana databases]]></title>
<link>http://bib.oxfordjournals.org/cgi/content/short/10/6/676?rss=1</link>
<description><![CDATA[
<p>The development of a systems based approach to problems in plant sciences requires integration of existing information resources. However, the available information is currently often incomplete and dispersed across many sources and the syntactic and semantic heterogeneity of the data is a challenge for integration. In this article, we discuss strategies for data integration and we use a graph based integration method (Ondex) to illustrate some of these challenges with reference to two example problems concerning integration of (i) metabolic pathway and (ii) protein interaction data for <I>Arabidopsis thaliana.</I> We quantify the degree of overlap for three commonly used pathway and protein interaction information sources. For pathways, we find that the AraCyc database contains the widest coverage of enzyme reactions and for protein interactions we find that the IntAct database provides the largest unique contribution to the integrated dataset. For both examples, however, we observe a relatively small amount of data common to all three sources. Analysis and visual exploration of the integrated networks was used to identify a number of practical issues relating to the interpretation of these datasets. We demonstrate the utility of these approaches to the analysis of groups of coexpressed genes from an individual microarray experiment, in the context of pathway information and for the combination of coexpression data with an integrated protein interaction network.</p>
]]></description>
<dc:creator><![CDATA[Lysenko, A., Hindle, M. M., Taubert, J., Saqi, M., Rawlings, C. J.]]></dc:creator>
<dc:date>Fri, 20 Nov 2009 07:05:03 PST</dc:date>
<dc:identifier>info:doi/10.1093/bib/bbp047</dc:identifier>
<dc:title><![CDATA[Data integration for plant genomics--exemplars from the integration of Arabidopsis thaliana databases]]></dc:title>
<dc:publisher>Oxford University Press</dc:publisher>
<prism:number>6</prism:number>
<prism:volume>10</prism:volume>
<prism:endingPage>693</prism:endingPage>
<prism:publicationDate>2009-11-01</prism:publicationDate>
<prism:startingPage>676</prism:startingPage>
<prism:section>Papers</prism:section>
</item>

<item rdf:about="http://bib.oxfordjournals.org/cgi/content/short/10/5/475?rss=1">
<title><![CDATA[An Ariadne's thread to the identification and annotation of noncoding RNAs in eukaryotes]]></title>
<link>http://bib.oxfordjournals.org/cgi/content/short/10/5/475?rss=1</link>
<description><![CDATA[
<p>Non-protein coding RNAs (ncRNAs) have emerged as a vast and heterogeneous portion of eukaryotic transcriptomes. Several ncRNA families, either short (&lt;200 nucleotides, nt) or long (&gt;200 nt), have been described and implicated in a variety of biological processes, from translation to gene expression regulation and nuclear trafficking. Most probably, other families are still to be discovered. Computational methods for ncRNA research require different approaches from the ones normally used in the prediction of protein-coding genes. Indeed, primary sequence alone is often insufficient to infer ncRNA functionality, whereas secondary structure and local conservation of portions of the transcript could provide useful information for both the prediction and the functional annotation of ncRNAs. Here we present an overview of computational methods and bioinformatics resources currently available for studying ncRNA genes, introducing the common themes as well as the different approaches required for long and short ncRNA identification and annotation.</p>
]]></description>
<dc:creator><![CDATA[Solda, G., Makunin, I. V., Sezerman, O. U., Corradin, A., Corti, G., Guffanti, A.]]></dc:creator>
<dc:date>Fri, 07 Aug 2009 09:10:07 PDT</dc:date>
<dc:identifier>info:doi/10.1093/bib/bbp022</dc:identifier>
<dc:title><![CDATA[An Ariadne's thread to the identification and annotation of noncoding RNAs in eukaryotes]]></dc:title>
<dc:publisher>Oxford University Press</dc:publisher>
<prism:number>5</prism:number>
<prism:volume>10</prism:volume>
<prism:endingPage>489</prism:endingPage>
<prism:publicationDate>2009-09-01</prism:publicationDate>
<prism:startingPage>475</prism:startingPage>
<prism:section>Papers</prism:section>
</item>

<item rdf:about="http://bib.oxfordjournals.org/cgi/content/short/10/5/490?rss=1">
<title><![CDATA[Expression profiling of microRNAs by deep sequencing]]></title>
<link>http://bib.oxfordjournals.org/cgi/content/short/10/5/490?rss=1</link>
<description><![CDATA[
<p>MicroRNAs are short non-coding RNAs that regulate the stability and translation of mRNAs. Profiling experiments, using microarray or deep sequencing technology, have identified microRNAs that are preferentially expressed in certain tissues, specific stages of development, or disease states such as cancer. Deep sequencing utilizes massively parallel sequencing, generating millions of small RNA sequence reads from a given sample. Profiling of microRNAs by deep sequencing measures absolute abundance and allows for the discovery of novel microRNAs that have eluded previous cloning and standard sequencing efforts. Public databases provide <I>in silico</I> predictions of microRNA gene targets by various algorithms. To better determine which of these predictions represent true positives, microRNA expression data can be integrated with gene expression data to identify putative microRNA:mRNA functional pairs. Here we discuss tools and methodologies for the analysis of microRNA expression data from deep sequencing.</p>
]]></description>
<dc:creator><![CDATA[Creighton, C. J., Reid, J. G., Gunaratne, P. H.]]></dc:creator>
<dc:date>Fri, 07 Aug 2009 09:10:07 PDT</dc:date>
<dc:identifier>info:doi/10.1093/bib/bbp019</dc:identifier>
<dc:title><![CDATA[Expression profiling of microRNAs by deep sequencing]]></dc:title>
<dc:publisher>Oxford University Press</dc:publisher>
<prism:number>5</prism:number>
<prism:volume>10</prism:volume>
<prism:endingPage>497</prism:endingPage>
<prism:publicationDate>2009-09-01</prism:publicationDate>
<prism:startingPage>490</prism:startingPage>
<prism:section>Papers</prism:section>
</item>

<item rdf:about="http://bib.oxfordjournals.org/cgi/content/short/10/5/498?rss=1">
<title><![CDATA[Towards accurate human promoter recognition: a review of currently used sequence features and classification methods]]></title>
<link>http://bib.oxfordjournals.org/cgi/content/short/10/5/498?rss=1</link>
<description><![CDATA[
<p>This review describes important advances that have been made during the past decade for genome-wide human promoter recognition. Interest in promoter recognition algorithms on a genome-wide scale is worldwide and touches on a number of practical systems that are important in analysis of gene regulation and in genome annotation without experimental support of ESTs, cDNAs or mRNAs. The main focus of this review is on feature extraction and model selection for accurate human promoter recognition, with descriptions of what they are, what has been accomplished, and what remains to be done.</p>
]]></description>
<dc:creator><![CDATA[Zeng, J., Zhu, S., Yan, H.]]></dc:creator>
<dc:date>Fri, 07 Aug 2009 09:10:07 PDT</dc:date>
<dc:identifier>info:doi/10.1093/bib/bbp027</dc:identifier>
<dc:title><![CDATA[Towards accurate human promoter recognition: a review of currently used sequence features and classification methods]]></dc:title>
<dc:publisher>Oxford University Press</dc:publisher>
<prism:number>5</prism:number>
<prism:volume>10</prism:volume>
<prism:endingPage>508</prism:endingPage>
<prism:publicationDate>2009-09-01</prism:publicationDate>
<prism:startingPage>498</prism:startingPage>
<prism:section>Papers</prism:section>
</item>

<item rdf:about="http://bib.oxfordjournals.org/cgi/content/short/10/5/509?rss=1">
<title><![CDATA[Computational methods for the detection of cis-regulatory modules]]></title>
<link>http://bib.oxfordjournals.org/cgi/content/short/10/5/509?rss=1</link>
<description><![CDATA[
<p>Metazoan transcription regulation occurs through the concerted action of multiple transcription factors that bind co-operatively to <I>cis</I>-regulatory modules (CRMs). The annotation of these key regulators of transcription is lagging far behind the annotation of the transcriptome itself. Here, we give an overview of existing computational methods to detect these CRMs in metazoan genomes. We subdivide these methods into three classes: CRM scanners screen sequences for CRMs based on predefined models that often consist of multiple position weight matrices (PWMs). CRM builders construct models of similar CRMs controlling a set of co-regulated or co-expressed genes. CRM genome screeners screen sequences or complete genomes for CRMs as homotypic or heterotypic clusters of binding sites for any combination of transcription factors. We believe that CRM scanners are currently the most advanced methods, although their applicability is limited. Finally, we argue that CRM builders that make use of PWM libraries will benefit greatly from future advances and will prove to be most instrumental for the annotation of regulatory regions in metazoan genomes.</p>
]]></description>
<dc:creator><![CDATA[Van Loo, P., Marynen, P.]]></dc:creator>
<dc:date>Fri, 07 Aug 2009 09:10:07 PDT</dc:date>
<dc:identifier>info:doi/10.1093/bib/bbp025</dc:identifier>
<dc:title><![CDATA[Computational methods for the detection of cis-regulatory modules]]></dc:title>
<dc:publisher>Oxford University Press</dc:publisher>
<prism:number>5</prism:number>
<prism:volume>10</prism:volume>
<prism:endingPage>524</prism:endingPage>
<prism:publicationDate>2009-09-01</prism:publicationDate>
<prism:startingPage>509</prism:startingPage>
<prism:section>Papers</prism:section>
</item>

<item rdf:about="http://bib.oxfordjournals.org/cgi/content/short/10/5/525?rss=1">
<title><![CDATA[Finding sequence motifs in prokaryotic genomes--a brief practical guide for a microbiologist]]></title>
<link>http://bib.oxfordjournals.org/cgi/content/short/10/5/525?rss=1</link>
<description><![CDATA[
<p>Finding significant nucleotide sequence motifs in prokaryotic genomes can be divided into three types of tasks: (1) supervised motif finding, where a sample of motif sequences is used to find other similar sequences in genomes; (2) unsupervised motif finding, which typically relates to the task of finding regulatory motifs and protein binding sites and (3) exploratory motif finding, which aims to identify potential functionally significant sequence motifs as those that are unusual in some statistical sense. This article provides a conceptual overview for each type of task, a brief description of basic algorithms used in their solution, and a review of selected relevant software available online.</p>
]]></description>
<dc:creator><![CDATA[Mrazek, J.]]></dc:creator>
<dc:date>Fri, 07 Aug 2009 09:10:07 PDT</dc:date>
<dc:identifier>info:doi/10.1093/bib/bbp032</dc:identifier>
<dc:title><![CDATA[Finding sequence motifs in prokaryotic genomes--a brief practical guide for a microbiologist]]></dc:title>
<dc:publisher>Oxford University Press</dc:publisher>
<prism:number>5</prism:number>
<prism:volume>10</prism:volume>
<prism:endingPage>536</prism:endingPage>
<prism:publicationDate>2009-09-01</prism:publicationDate>
<prism:startingPage>525</prism:startingPage>
<prism:section>Papers</prism:section>
</item>

<item rdf:about="http://bib.oxfordjournals.org/cgi/content/short/10/5/537?rss=1">
<title><![CDATA[Development of biomarker classifiers from high-dimensional data]]></title>
<link>http://bib.oxfordjournals.org/cgi/content/short/10/5/537?rss=1</link>
<description><![CDATA[
<p>Recent development of high-throughput technology has accelerated interest in the development of molecular biomarker classifiers for safety assessment, disease diagnostics and prognostics, and prediction of response for patient assignment. This article reviews and evaluates some important aspects and key issues in the development of biomarker classifiers. Development of a biomarker classifier for high-throughput data involves two components: (i) model building and (ii) performance assessment. This article focuses on feature selection in model building and cross validation for performance assessment. A &lsquo;frequency&rsquo; approach to feature selection is presented and compared to the &lsquo;conventional&rsquo; approach in terms of the predictive accuracy and stability of the selected feature set. The two approaches are compared based on four biomarker classifiers, each with a different feature selection method and well-known classification algorithm. In each of the four classifiers the feature predictor set selected by the frequency approach is more stable than the feature set selected by the conventional approach.</p>
]]></description>
<dc:creator><![CDATA[Baek, S., Tsai, C.-A., Chen, J. J.]]></dc:creator>
<dc:date>Fri, 07 Aug 2009 09:10:07 PDT</dc:date>
<dc:identifier>info:doi/10.1093/bib/bbp016</dc:identifier>
<dc:title><![CDATA[Development of biomarker classifiers from high-dimensional data]]></dc:title>
<dc:publisher>Oxford University Press</dc:publisher>
<prism:number>5</prism:number>
<prism:volume>10</prism:volume>
<prism:endingPage>546</prism:endingPage>
<prism:publicationDate>2009-09-01</prism:publicationDate>
<prism:startingPage>537</prism:startingPage>
<prism:section>Papers</prism:section>
</item>

<item rdf:about="http://bib.oxfordjournals.org/cgi/content/short/10/5/547?rss=1">
<title><![CDATA[Optimized detection of differential expression in global profiling experiments: case studies in clinical transcriptomic and quantitative proteomic datasets]]></title>
<link>http://bib.oxfordjournals.org/cgi/content/short/10/5/547?rss=1</link>
<description><![CDATA[
<p>Identification of reliable molecular markers that show differential expression between distinct groups of samples has remained a fundamental research problem in many large-scale profiling studies, such as those based on DNA microarray or mass-spectrometry technologies. Despite the availability of a wide spectrum of statistical procedures, the users of the high-throughput platforms are still facing the crucial challenge of deciding which test statistic is best adapted to the intrinsic properties of their own datasets. To meet this challenge, we recently introduced an adaptive procedure, named ROTS (Reproducibility-Optimized Test Statistic), which learns an optimal statistic directly from the given data, and whose relative benefits have previously been shown in comparison with state-of-the-art procedures for detecting differential expression. Using gene expression microarray and mass-spectrometry (MS)-based protein expression datasets as case studies, we illustrate here the practical usage and advantages of ROTS toward detecting reliable marker lists in clinical transcriptomic and proteomic studies. In a public leukemia microarray dataset, the procedure could improve the sensitivity of the gene marker lists detected with high specificity. When applied to a recent LC-MS dataset, involving plasma samples from severe burn patients, the procedure could identify several peptide markers that remained undetected in the conventional analysis, thus demonstrating the effectiveness of ROTS also for global quantitative proteomic studies. To promote its widespread usage, we have made freely available efficient implementations of ROTS, which are easily accessible either as a stand-alone R-package or as integrated in the open-source data analysis software Chipster.</p>
]]></description>
<dc:creator><![CDATA[Elo, L. L., Hiissa, J., Tuimala, J., Kallio, A., Korpelainen, E., Aittokallio, T.]]></dc:creator>
<dc:date>Fri, 07 Aug 2009 09:10:07 PDT</dc:date>
<dc:identifier>info:doi/10.1093/bib/bbp033</dc:identifier>
<dc:title><![CDATA[Optimized detection of differential expression in global profiling experiments: case studies in clinical transcriptomic and quantitative proteomic datasets]]></dc:title>
<dc:publisher>Oxford University Press</dc:publisher>
<prism:number>5</prism:number>
<prism:volume>10</prism:volume>
<prism:endingPage>555</prism:endingPage>
<prism:publicationDate>2009-09-01</prism:publicationDate>
<prism:startingPage>547</prism:startingPage>
<prism:section>Papers</prism:section>
</item>

<item rdf:about="http://bib.oxfordjournals.org/cgi/content/short/10/5/556?rss=1">
<title><![CDATA[Stability and aggregation of ranked gene lists]]></title>
<link>http://bib.oxfordjournals.org/cgi/content/short/10/5/556?rss=1</link>
<description><![CDATA[
<p>Ranked gene lists are highly instable in the sense that similar measures of differential gene expression may yield very different rankings, and that a small change of the data set usually affects the obtained gene list considerably. Stability issues have long been under-considered in the literature, but they have grown to a hot topic in the last few years, perhaps as a consequence of the increasing skepticism on the reproducibility and clinical applicability of molecular research findings. In this article, we review existing approaches for the assessment of stability of ranked gene lists and the related problem of aggregation, give some practical recommendations, and warn against potential misuse of these methods. This overview is illustrated through an application to a recent leukemia data set using the freely available Bioconductor package GeneSelector.</p>
]]></description>
<dc:creator><![CDATA[Boulesteix, A.-L., Slawski, M.]]></dc:creator>
<dc:date>Fri, 07 Aug 2009 09:10:07 PDT</dc:date>
<dc:identifier>info:doi/10.1093/bib/bbp034</dc:identifier>
<dc:title><![CDATA[Stability and aggregation of ranked gene lists]]></dc:title>
<dc:publisher>Oxford University Press</dc:publisher>
<prism:number>5</prism:number>
<prism:volume>10</prism:volume>
<prism:endingPage>568</prism:endingPage>
<prism:publicationDate>2009-09-01</prism:publicationDate>
<prism:startingPage>556</prism:startingPage>
<prism:section>Papers</prism:section>
</item>

<item rdf:about="http://bib.oxfordjournals.org/cgi/content/short/10/5/569?rss=1">
<title><![CDATA[Architecture, function and prediction of long signal peptides]]></title>
<link>http://bib.oxfordjournals.org/cgi/content/short/10/5/569?rss=1</link>
<description><![CDATA[
<p>Protein targeting in eukaryotic cells is vital for cell survival and development. N-terminal signal peptides guide proteins to the membrane of the endoplasmic reticulum (ER) and initiate translocation into the ER lumen. Here, we review the status of signal peptide architecture and prediction with an emphasis on exceptionally long signal peptides, which often escape the notion of the currently available prediction methods. We benchmark publicly available prediction methods for their ability to correctly identify exceptionally long signal peptides. A set of 136 annotated eukaryotic signals served as reference data. The best prediction tool detected only 63%. A potential reason for the poor performance is the domain architecture of long signal peptides, whose structural peculiarities are insufficiently considered by current prediction algorithms. To overcome this limitation, we motivate a general domain view of long signal peptides, which becomes detectable when both the overall length and secondary structure of long signal peptides are taken into consideration. This concept provides a structural framework for identifying and understanding multiple targeting and post-targeting functions.</p>
]]></description>
<dc:creator><![CDATA[Hiss, J. A., Schneider, G.]]></dc:creator>
<dc:date>Fri, 07 Aug 2009 09:10:07 PDT</dc:date>
<dc:identifier>info:doi/10.1093/bib/bbp030</dc:identifier>
<dc:title><![CDATA[Architecture, function and prediction of long signal peptides]]></dc:title>
<dc:publisher>Oxford University Press</dc:publisher>
<prism:number>5</prism:number>
<prism:volume>10</prism:volume>
<prism:endingPage>578</prism:endingPage>
<prism:publicationDate>2009-09-01</prism:publicationDate>
<prism:startingPage>569</prism:startingPage>
<prism:section>Papers</prism:section>
</item>

<item rdf:about="http://bib.oxfordjournals.org/cgi/content/short/10/5/579?rss=1">
<title><![CDATA[Recent advances in computer-aided drug design]]></title>
<link>http://bib.oxfordjournals.org/cgi/content/short/10/5/579?rss=1</link>
<description><![CDATA[
<p>Modern drug discovery is characterized by the production of vast quantities of compounds and the need to examine these huge libraries in short periods of time. The need to store, manage and analyze these rapidly increasing resources has given rise to the field known as computer-aided drug design (CADD). CADD represents computational methods and resources that are used to facilitate the design and discovery of new therapeutic solutions. Digital repositories, containing detailed information on drugs and other useful compounds, are goldmines for the study of chemical reactions capabilities. Design libraries, with the potential to generate molecular variants in their entirety, allow the selection and sampling of chemical compounds with diverse characteristics. Fold recognition, for studying sequence-structure homology between protein sequences and structures, are helpful for inferring binding sites and molecular functions. Virtual screening, the <I>in silico</I> analog of high-throughput screening, offers great promise for systematic evaluation of huge chemical libraries to identify potential lead candidates that can be synthesized and tested. In this article, we present an overview of the most important data sources and computational methods for the discovery of new molecular entities. The workflow of the entire virtual screening campaign is discussed, from data collection through to post-screening analysis.</p>
]]></description>
<dc:creator><![CDATA[Song, C. M., Lim, S. J., Tong, J. C.]]></dc:creator>
<dc:date>Fri, 07 Aug 2009 09:10:07 PDT</dc:date>
<dc:identifier>info:doi/10.1093/bib/bbp023</dc:identifier>
<dc:title><![CDATA[Recent advances in computer-aided drug design]]></dc:title>
<dc:publisher>Oxford University Press</dc:publisher>
<prism:number>5</prism:number>
<prism:volume>10</prism:volume>
<prism:endingPage>591</prism:endingPage>
<prism:publicationDate>2009-09-01</prism:publicationDate>
<prism:startingPage>579</prism:startingPage>
<prism:section>Papers</prism:section>
</item>

<item rdf:about="http://bib.oxfordjournals.org/cgi/content/short/10/4/343?rss=1">
<title><![CDATA[Editorial]]></title>
<link>http://bib.oxfordjournals.org/cgi/content/short/10/4/343?rss=1</link>
<description><![CDATA[]]></description>
<dc:creator><![CDATA[Dubitzky, W.]]></dc:creator>
<dc:date>Sun, 07 Jun 2009 22:39:42 PDT</dc:date>
<dc:identifier>info:doi/10.1093/bib/bbp031</dc:identifier>
<dc:title><![CDATA[Editorial]]></dc:title>
<dc:publisher>Oxford University Press</dc:publisher>
<prism:number>4</prism:number>
<prism:volume>10</prism:volume>
<prism:endingPage>344</prism:endingPage>
<prism:publicationDate>2009-07-01</prism:publicationDate>
<prism:startingPage>343</prism:startingPage>
<prism:section>Editorial</prism:section>
</item>

<item rdf:about="http://bib.oxfordjournals.org/cgi/content/short/10/4/345?rss=1">
<title><![CDATA[Approaches to neuroscience data integration]]></title>
<link>http://bib.oxfordjournals.org/cgi/content/short/10/4/345?rss=1</link>
<description><![CDATA[
<p>As the number of neuroscience databases increases, the need for neuroscience data integration grows. This paper reviews and compares several approaches, including the Neuroscience Database Gateway (NDG), Neuroscience Information Framework (NIF) and Entrez Neuron, which enable neuroscience database annotation and integration. These approaches cover a range of activities spanning from registry, discovery and integration of a wide variety of neuroscience data sources. They also provide different user interfaces for browsing, querying and displaying query results. In Entrez Neuron, for example, four different facets or tree views (neuron, neuronal property, gene and drug) are used to hierarchically organize concepts that can be used for querying a collection of ontologies. The facets are also used to define the structure of the query results.</p>
]]></description>
<dc:creator><![CDATA[Cheung, K.-H., Lim, E., Samwald, M., Chen, H., Marenco, L., Holford, M. E., Morse, T. M., Mutalik, P., Shepherd, G. M., Miller, P. L.]]></dc:creator>
<dc:date>Sun, 07 Jun 2009 22:39:42 PDT</dc:date>
<dc:identifier>info:doi/10.1093/bib/bbp029</dc:identifier>
<dc:title><![CDATA[Approaches to neuroscience data integration]]></dc:title>
<dc:publisher>Oxford University Press</dc:publisher>
<prism:number>4</prism:number>
<prism:volume>10</prism:volume>
<prism:endingPage>353</prism:endingPage>
<prism:publicationDate>2009-07-01</prism:publicationDate>
<prism:startingPage>345</prism:startingPage>
<prism:section>Papers</prism:section>
</item>

<item rdf:about="http://bib.oxfordjournals.org/cgi/content/short/10/4/354?rss=1">
<title><![CDATA[Genome assembly reborn: recent computational challenges]]></title>
<link>http://bib.oxfordjournals.org/cgi/content/short/10/4/354?rss=1</link>
<description><![CDATA[
<p>Research into genome assembly algorithms has experienced a resurgence due to new challenges created by the development of next generation sequencing technologies. Several genome assemblers have been published in recent years specifically targeted at the new sequence data; however, the ever-changing technological landscape leads to the need for continued research. In addition, the low cost of next generation sequencing data has led to an increased use of sequencing in new settings. For example, the new field of metagenomics relies on large-scale sequencing of entire microbial communities instead of isolate genomes, leading to new computational challenges. In this article, we outline the major algorithmic approaches for genome assembly and describe recent developments in this domain.</p>
]]></description>
<dc:creator><![CDATA[Pop, M.]]></dc:creator>
<dc:date>Sun, 07 Jun 2009 22:39:42 PDT</dc:date>
<dc:identifier>info:doi/10.1093/bib/bbp026</dc:identifier>
<dc:title><![CDATA[Genome assembly reborn: recent computational challenges]]></dc:title>
<dc:publisher>Oxford University Press</dc:publisher>
<prism:number>4</prism:number>
<prism:volume>10</prism:volume>
<prism:endingPage>366</prism:endingPage>
<prism:publicationDate>2009-07-01</prism:publicationDate>
<prism:startingPage>354</prism:startingPage>
<prism:section>Papers</prism:section>
</item>

<item rdf:about="http://bib.oxfordjournals.org/cgi/content/short/10/4/367?rss=1">
<title><![CDATA[Computational biology for cardiovascular biomarker discovery]]></title>
<link>http://bib.oxfordjournals.org/cgi/content/short/10/4/367?rss=1</link>
<description><![CDATA[
<p>Computational biology is essential in the process of translating biological knowledge into clinical practice, as well as in the understanding of biological phenomena based on the resources and technologies originating from the clinical environment. One such key contribution of computational biology is the discovery of biomarkers for predicting clinical outcomes using &lsquo;omic&rsquo; information. This process involves the predictive modelling and integration of different types of data and knowledge for screening, diagnostic or prognostic purposes. Moreover, this requires the design and combination of different methodologies based on statistical analysis and machine learning. This article introduces key computational approaches and applications to biomarker discovery based on different types of &lsquo;omic&rsquo; data. Although we emphasize applications in cardiovascular research, the computational requirements and advances discussed here are also relevant to other domains. We will start by introducing some of the contributions of computational biology to translational research, followed by an overview of methods and technologies used for the identification of biomarkers with predictive or classification value. The main types of &lsquo;omic&rsquo; approaches to biomarker discovery will be presented with specific examples from cardiovascular research. This will include a review of computational methodologies for single-source and integrative data applications. Major computational methods for model evaluation will be described together with recommendations for reporting models and results. We will present recent advances in cardiovascular biomarker discovery based on the combination of gene expression and functional network analyses. The review will conclude with a discussion of key challenges for computational biology, including perspectives from the biosciences and clinical areas.</p>
]]></description>
<dc:creator><![CDATA[Azuaje, F., Devaux, Y., Wagner, D.]]></dc:creator>
<dc:date>Sun, 07 Jun 2009 22:39:42 PDT</dc:date>
<dc:identifier>info:doi/10.1093/bib/bbp008</dc:identifier>
<dc:title><![CDATA[Computational biology for cardiovascular biomarker discovery]]></dc:title>
<dc:publisher>Oxford University Press</dc:publisher>
<prism:number>4</prism:number>
<prism:volume>10</prism:volume>
<prism:endingPage>377</prism:endingPage>
<prism:publicationDate>2009-07-01</prism:publicationDate>
<prism:startingPage>367</prism:startingPage>
<prism:section>Papers</prism:section>
</item>

<item rdf:about="http://bib.oxfordjournals.org/cgi/content/short/10/4/378?rss=1">
<title><![CDATA[FINDSITE: a combined evolution/structure-based approach to protein function prediction]]></title>
<link>http://bib.oxfordjournals.org/cgi/content/short/10/4/378?rss=1</link>
<description><![CDATA[
<p>A key challenge of the post-genomic era is the identification of the function(s) of all the molecules in a given organism. Here, we review the status of sequence and structure-based approaches to protein function inference and ligand screening that can provide functional insights for a significant fraction of the ~50% of ORFs of unassigned function in an average proteome. We then describe FINDSITE, a recently developed algorithm for ligand binding site prediction, ligand screening and molecular function prediction, which is based on binding site conservation across evolutionary distant proteins identified by threading. Importantly, FINDSITE gives comparable results when high-resolution experimental structures as well as predicted protein models are used.</p>
]]></description>
<dc:creator><![CDATA[Skolnick, J., Brylinski, M.]]></dc:creator>
<dc:date>Sun, 07 Jun 2009 22:39:42 PDT</dc:date>
<dc:identifier>info:doi/10.1093/bib/bbp017</dc:identifier>
<dc:title><![CDATA[FINDSITE: a combined evolution/structure-based approach to protein function prediction]]></dc:title>
<dc:publisher>Oxford University Press</dc:publisher>
<prism:number>4</prism:number>
<prism:volume>10</prism:volume>
<prism:endingPage>391</prism:endingPage>
<prism:publicationDate>2009-07-01</prism:publicationDate>
<prism:startingPage>378</prism:startingPage>
<prism:section>Papers</prism:section>
</item>

<item rdf:about="http://bib.oxfordjournals.org/cgi/content/short/10/4/392?rss=1">
<title><![CDATA[Biological knowledge management: the emerging role of the Semantic Web technologies]]></title>
<link>http://bib.oxfordjournals.org/cgi/content/short/10/4/392?rss=1</link>
<description><![CDATA[
<p>New knowledge is produced at a continuously increasing speed, and the list of papers, databases and other knowledge sources that a researcher in the life sciences needs to cope with is actually turning into a problem rather than an asset. The adequate management of knowledge is therefore becoming fundamentally important for life scientists, especially if they work with approaches that thoroughly depend on knowledge integration, such as systems biology. Several initiatives to organize biological knowledge sources into a readily exploitable resourceome are presently being carried out. Ontologies and Semantic Web technologies revolutionize these efforts. Here, we review the benefits, trends, current possibilities, and the potential this holds for the biosciences.</p>
]]></description>
<dc:creator><![CDATA[Antezana, E., Kuiper, M., Mironov, V.]]></dc:creator>
<dc:date>Sun, 07 Jun 2009 22:39:42 PDT</dc:date>
<dc:identifier>info:doi/10.1093/bib/bbp024</dc:identifier>
<dc:title><![CDATA[Biological knowledge management: the emerging role of the Semantic Web technologies]]></dc:title>
<dc:publisher>Oxford University Press</dc:publisher>
<prism:number>4</prism:number>
<prism:volume>10</prism:volume>
<prism:endingPage>407</prism:endingPage>
<prism:publicationDate>2009-07-01</prism:publicationDate>
<prism:startingPage>392</prism:startingPage>
<prism:section>Papers</prism:section>
</item>

<item rdf:about="http://bib.oxfordjournals.org/cgi/content/short/10/4/408?rss=1">
<title><![CDATA[Computational methods for discovering gene networks from expression data]]></title>
<link>http://bib.oxfordjournals.org/cgi/content/short/10/4/408?rss=1</link>
<description><![CDATA[
<p>Designing and conducting experiments are routine practices for modern biologists. The real challenge, especially in the post-genome era, usually comes not from acquiring data, but from subsequent activities such as data processing, analysis, knowledge generation and gaining insight into the research question of interest. The approach of inferring gene regulatory networks (GRNs) has been flourishing for many years, and new methods from mathematics, information science, engineering and social sciences have been applied. We review different kinds of computational methods biologists use to infer networks of varying levels of accuracy and complexity. The primary concern of biologists is how to translate the inferred network into hypotheses that can be tested with real-life experiments. Taking the biologists&rsquo; viewpoint, we scrutinized several methods for predicting GRNs in mammalian cells, and more importantly show how the power of different knowledge databases of different types can be used to identify modules and subnetworks, thereby reducing complexity and facilitating the generation of testable hypotheses.</p>
]]></description>
<dc:creator><![CDATA[Lee, W.-P., Tzou, W.-S.]]></dc:creator>
<dc:date>Sun, 07 Jun 2009 22:39:42 PDT</dc:date>
<dc:identifier>info:doi/10.1093/bib/bbp028</dc:identifier>
<dc:title><![CDATA[Computational methods for discovering gene networks from expression data]]></dc:title>
<dc:publisher>Oxford University Press</dc:publisher>
<prism:number>4</prism:number>
<prism:volume>10</prism:volume>
<prism:endingPage>423</prism:endingPage>
<prism:publicationDate>2009-07-01</prism:publicationDate>
<prism:startingPage>408</prism:startingPage>
<prism:section>Papers</prism:section>
</item>

<item rdf:about="http://bib.oxfordjournals.org/cgi/content/short/10/4/424?rss=1">
<title><![CDATA[Computational systems biology of the cell cycle]]></title>
<link>http://bib.oxfordjournals.org/cgi/content/short/10/4/424?rss=1</link>
<description><![CDATA[
<p>One of the early success stories of computational systems biology was the work done on cell-cycle regulation. The earliest mathematical descriptions of cell-cycle control evolved into very complex, detailed computational models that describe the regulation of cell division in many different cell types. On the way these models predicted several dynamical properties and unknown components of the system that were later experimentally verified/identified. Still, research on this field is far from over. We need to understand how the core cell-cycle machinery is controlled by internal and external signals, also in yeast cells and in the more complex regulatory networks of higher eukaryotes. Furthermore, there are many computational challenges what we face as new types of data appear thanks to continuing advances in experimental techniques. We have to deal with cell-to-cell variations, revealed by single cell measurements, as well as the tremendous amount of data flowing from high throughput machines. We need new computational concepts and tools to handle these data and develop more detailed, more precise models of cell-cycle regulation in various organisms. Here we review past and present of computational modeling of cell-cycle regulation, and discuss possible future directions of the field.</p>
]]></description>
<dc:creator><![CDATA[Csikasz-Nagy, A.]]></dc:creator>
<dc:date>Sun, 07 Jun 2009 22:39:42 PDT</dc:date>
<dc:identifier>info:doi/10.1093/bib/bbp005</dc:identifier>
<dc:title><![CDATA[Computational systems biology of the cell cycle]]></dc:title>
<dc:publisher>Oxford University Press</dc:publisher>
<prism:number>4</prism:number>
<prism:volume>10</prism:volume>
<prism:endingPage>434</prism:endingPage>
<prism:publicationDate>2009-07-01</prism:publicationDate>
<prism:startingPage>424</prism:startingPage>
<prism:section>Papers</prism:section>
</item>

<item rdf:about="http://bib.oxfordjournals.org/cgi/content/short/10/4/435?rss=1">
<title><![CDATA[Flux balance analysis of biological systems: applications and challenges]]></title>
<link>http://bib.oxfordjournals.org/cgi/content/short/10/4/435?rss=1</link>
<description><![CDATA[
<p>Systems level modelling and simulations of biological processes are proving to be invaluable in obtaining a quantitative and dynamic perspective of various aspects of cellular function. In particular, constraint-based analyses of metabolic networks have gained considerable popularity for simulating cellular metabolism, of which flux balance analysis (FBA), is most widely used. Unlike mechanistic simulations that depend on accurate kinetic data, which are scarcely available, FBA is based on the principle of conservation of mass in a network, which utilizes the stoichiometric matrix and a biologically relevant objective function to identify optimal reaction flux distributions. FBA has been used to analyse genome-scale reconstructions of several organisms; it has also been used to analyse the effect of perturbations, such as gene deletions or drug inhibitions <I>in silico</I>. This article reviews the usefulness of FBA as a tool for gaining biological insights, advances in methodology enabling integration of regulatory information and thermodynamic constraints, and finally addresses the challenges that lie ahead. Various use scenarios and biological insights obtained from FBA, and applications in fields such metabolic engineering and drug target identification, are also discussed. Genome-scale constraint-based models have an immense potential for building and testing hypotheses, as well as to guide experimentation.</p>
]]></description>
<dc:creator><![CDATA[Raman, K., Chandra, N.]]></dc:creator>
<dc:date>Sun, 07 Jun 2009 22:39:42 PDT</dc:date>
<dc:identifier>info:doi/10.1093/bib/bbp011</dc:identifier>
<dc:title><![CDATA[Flux balance analysis of biological systems: applications and challenges]]></dc:title>
<dc:publisher>Oxford University Press</dc:publisher>
<prism:number>4</prism:number>
<prism:volume>10</prism:volume>
<prism:endingPage>449</prism:endingPage>
<prism:publicationDate>2009-07-01</prism:publicationDate>
<prism:startingPage>435</prism:startingPage>
<prism:section>Papers</prism:section>
</item>

<item rdf:about="http://bib.oxfordjournals.org/cgi/content/short/10/4/450?rss=1">
<title><![CDATA[The virtual cell--a candidate co-ordinator for 'middle-out' modelling of biological systems]]></title>
<link>http://bib.oxfordjournals.org/cgi/content/short/10/4/450?rss=1</link>
<description><![CDATA[
<p>Understanding the functioning of biological systems depends on tackling complexity spanning spatial scales from genome to organ to whole organism. The basic unit of life, the cell, acts to co-ordinate information received across these scales and processes the myriad of signals to produce an integrated cellular response. Cells interact with and respond to other cells through direct or indirect contact, resulting in emergent structure and function of tissues and organs. Systems biology has traditionally used either a &lsquo;top-down&rsquo; or &lsquo;bottom-up&rsquo; approach. However, neither approach takes account of heterogeneity or &lsquo;noise&rsquo;, which is an inherent feature of cellular behaviour and may have significant impact on system level behaviour. We review existing approaches to modelling that use cellular automata or agent-based methodologies, where individual cells are represented as equivalent virtual entities governed by simple rules. These paradigms allow a direct one-to-one mapping between real and virtual cells that can be exploited in terms of acquiring parameters from experimental systems, or for model validation. Such models are inherently extensible and can be integrated with other modelling modalities (e.g. partial or ordinary differential equations) to model multi-scale phenomena. Alternatively, hierarchical agent models may be used to explore the functions of biological systems across temporal and spatial scales. This review examines individual-based models and the application of the paradigm to explore multi-scale phenomena in biology. In so doing, it demonstrates how cellular-based models have begun to play an important role in the development of &lsquo;middle-out&rsquo; models, but with considerable potential for future development.</p>
]]></description>
<dc:creator><![CDATA[Walker, D. C., Southgate, J.]]></dc:creator>
<dc:date>Sun, 07 Jun 2009 22:39:42 PDT</dc:date>
<dc:identifier>info:doi/10.1093/bib/bbp010</dc:identifier>
<dc:title><![CDATA[The virtual cell--a candidate co-ordinator for 'middle-out' modelling of biological systems]]></dc:title>
<dc:publisher>Oxford University Press</dc:publisher>
<prism:number>4</prism:number>
<prism:volume>10</prism:volume>
<prism:endingPage>461</prism:endingPage>
<prism:publicationDate>2009-07-01</prism:publicationDate>
<prism:startingPage>450</prism:startingPage>
<prism:section>Papers</prism:section>
</item>

<item rdf:about="http://bib.oxfordjournals.org/cgi/content/short/10/4/462?rss=1">
<title><![CDATA[Exploring autonomy through computational biomodelling]]></title>
<link>http://bib.oxfordjournals.org/cgi/content/short/10/4/462?rss=1</link>
<description><![CDATA[
<p>The question of whether living organisms possess autonomy of action is tied up with the nature of causal efficacy. Yet the nature of organisms is such that they frequently defy conventional causal language. Did the fig wasp select the fig, or vice versa? Is this an epithelial cell because of its genetic structure, or because it develops within the epithelium? The intimate coupling of biological levels of organisation leads developmental systems theory to deconstruct the biological organism into a life-cycle process which constitutes itself from the resources available within a complete developmental system. This radical proposal necessarily raises questions regarding the ontological status of organisms: Does an organism possess existence distinguishable from its molecular composition and social environment? The ambiguity of biological causality makes such questions difficult to answer or even formulate, and computational biology has an important role to play in operationalising the language in which they are framed. In this article we review the role played by computational biomodels in shedding light on the ontological status of organisms. These models are drawn from backgrounds ranging from molecular kinetics to niche construction, and all attempt to trace biological processes to a causal, and therefore existent, source. We conclude that computational biomodelling plays a fertile role in furnishing a proof of concept for conjectures in the philosophy of biology, and suggests the need for a process-based ontology of biological systems.</p>
]]></description>
<dc:creator><![CDATA[Palfreyman, N.]]></dc:creator>
<dc:date>Sun, 07 Jun 2009 22:39:42 PDT</dc:date>
<dc:identifier>info:doi/10.1093/bib/bbp003</dc:identifier>
<dc:title><![CDATA[Exploring autonomy through computational biomodelling]]></dc:title>
<dc:publisher>Oxford University Press</dc:publisher>
<prism:number>4</prism:number>
<prism:volume>10</prism:volume>
<prism:endingPage>474</prism:endingPage>
<prism:publicationDate>2009-07-01</prism:publicationDate>
<prism:startingPage>462</prism:startingPage>
<prism:section>Papers</prism:section>
</item>

</rdf:RDF>