<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:creativeCommons="http://backend.userland.com/creativeCommonsRssModule" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/" version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:media="http://search.yahoo.com/mrss/">
  <channel>
    <title>Nature Precedings - Tag feed for sequence</title>
    <link>http://precedings.nature.com/tags/sequence</link>
    <description>Recently posted documents tagged with 'sequence'</description>
    <dc:publisher>Nature Publishing Group</dc:publisher>
    <dc:language>en</dc:language>
    <prism:publicationName>Nature Precedings</prism:publicationName>
    <image>
      <title>Nature Precedings</title>
      <url>http://precedings.nature.com/images/header_logo.gif</url>
      <link>http://precedings.nature.com</link>
    </image>
    <atom:link type="application/rss+xml" rel="self" href="http://precedings.nature.com/tags/sequence/feed"/>
    <item>
      <title>A Formal Ontology of Sequences</title>
      <link>http://dx.doi.org/10.1038/npre.2009.3537.1</link>
      <description>The Sequence Ontology is an OBO Foundry ontology that provides categories of sequences and sequence features that are applied to the annotation of genomes.  To facilitate interoperability with other domain ontologies and to provide a foundation for automated inference, we provide here an axiom system for the Sequence and Junction categories in first- and second-order predicate logics.</description>
      <guid>http://dx.doi.org/10.1038/npre.2009.3537.1</guid>
      <pubDate>Mon, 03 Aug 2009 09:40:08 UTC</pubDate>
      <dc:title>A Formal Ontology of Sequences</dc:title>
      <dc:identifier>doi:10.1038/npre.2009.3537.1</dc:identifier>
      <dc:date>2009-08-03</dc:date>
      <dc:creator>Robert Hoehndorf</dc:creator>
      <prism:publicationName>Nature Precedings</prism:publicationName>
      <prism:publicationDate>2009-08-03T09:40:08Z</prism:publicationDate>
      <prism:category>Manuscript</prism:category>
      <prism:section>Genetics &amp; Genomics</prism:section>
      <prism:section>Bioinformatics</prism:section>
      <media:thumbnail url="http://precedings.nature.com/documents/3537/version/1/files/npre20093537-1.pdf.thumb.png"/>
      <creativeCommons:license>http://creativecommons.org/licenses/by/3.0/</creativeCommons:license>
    </item>
    <item>
      <title>The Eukaryotic Linear Motif Resource (ELM): Regulatory Sites in Proteins</title>
      <link>http://dx.doi.org/10.1038/npre.2009.3152.1</link>
      <description>Linear motifs are short and evolutionarily variable sequence patterns associated with particular functions often involving post-translational modifications, such as phosphorylation, acetylation, glycosylation, targeting signals for cellular compartments, protein cleavage sites and protein&#8211;protein interaction.Experimentally they are often neglected because their short length (4-10 residues long), and the fact that they often reside in disordered regions in proteins makes them difficult to detect. For a similar reason, using the sole regular expression to detect linear motifs matches in sequences has almost no predictive power because they are both statistically insignificant and prone to massive over-prediction.The Eukaryotic Linear Motif resource (ELM &amp;#8211; http://elm.eu.org) is a bioinformatics facility for investigating candidate short functional motifs in eukaryotic proteins. The ELM database to date has collected more than 140 motifs and their regular expressions patterns as well as information about their instances of occurrence, distribution, crystal structure, publications, etc.In order to reduce the over-prediction inherent to pattern matching against protein sequences and to discriminate true from false positive motif matches, context-based rules and logical filters are applied. The current version includes cell compartment, phylogeny, globular domain clash filters and the more recent structural filter based on known three-dimensional information that relies on structural information, such as residue solvent accessibility and secondary structure features. This implies that a candidate motif can be excluded from further consideration if the protein resides in the wrong cellular compartment or the motif is buried in the core of a globular domain. By considering additional types of context information, we expect that prediction of functional sites by ELM can be considerably improved. In cases where the user cannot provide relevant context information, we consider providing predictions of contextual information in order to improve the ELM performance. For example, since the ELM motif database has been annotated with biological process GO terms, the system could be prepared for addition of a new context filter using biological process.</description>
      <guid>http://dx.doi.org/10.1038/npre.2009.3152.1</guid>
      <pubDate>Thu, 23 Apr 2009 17:20:38 UTC</pubDate>
      <dc:title>The Eukaryotic Linear Motif Resource (ELM): Regulatory Sites in Proteins</dc:title>
      <dc:identifier>doi:10.1038/npre.2009.3152.1</dc:identifier>
      <dc:date>2009-04-23</dc:date>
      <dc:creator>Francesca Diella</dc:creator>
      <prism:publicationName>Nature Precedings</prism:publicationName>
      <prism:publicationDate>2009-04-23T17:20:38Z</prism:publicationDate>
      <prism:category>Poster</prism:category>
      <prism:section>Bioinformatics</prism:section>
      <media:thumbnail url="http://precedings.nature.com/documents/3152/version/1/files/npre20093152-1.pdf.thumb.png"/>
      <creativeCommons:license>http://creativecommons.org/licenses/by/3.0/</creativeCommons:license>
    </item>
    <item>
      <title>New checksum functions for Biopython</title>
      <link>http://dx.doi.org/10.1038/npre.2007.278.1</link>
      <description>Checksum algorithms are used in biological databases for integrity check and identification purposes. CRC64 is the only checksum algorithm already included in Biopython. This work proposes two new implementation of known algorithms (GCG Checksum and SEGUID). There is also an application based on SEGUID: Looking for redundancy between two FASTA files full of protein sequences based only in sequence information, by comparing the SEGUIDs of both files.The code is shown in the manuscript and may be available at Biopython.org.</description>
      <guid>http://dx.doi.org/10.1038/npre.2007.278.1</guid>
      <pubDate>Thu, 28 Jun 2007 04:48:13 UTC</pubDate>
      <dc:title>New checksum functions for Biopython</dc:title>
      <dc:identifier>doi:10.1038/npre.2007.278.1</dc:identifier>
      <dc:date>2007-06-28</dc:date>
      <dc:creator>Sebastian Bassi</dc:creator>
      <prism:publicationName>Nature Precedings</prism:publicationName>
      <prism:publicationDate>2007-06-28T04:48:13Z</prism:publicationDate>
      <prism:category>Presentation</prism:category>
      <prism:section>Bioinformatics</prism:section>
      <media:thumbnail url="http://precedings.nature.com/documents/278/version/1/files/npre2007278-1.pdf.thumb.png"/>
      <creativeCommons:license>http://creativecommons.org/licenses/by/2.5/</creativeCommons:license>
    </item>
  </channel>
</rss>
