Serveur d'exploration sur la recherche en informatique en Lorraine

Attention, ce site est en cours de développement !
Attention, site généré par des moyens informatiques à partir de corpus bruts.
Les informations ne sont donc pas validées.

A unifying framework for seed sensitivity and its application to subset seeds

Identifieur interne : 000073 ( Pmc/Corpus ); précédent : 000072; suivant : 000074

A unifying framework for seed sensitivity and its application to subset seeds

Auteurs : Gregory Kucherov ; Laurent Noé ; Mihkail Roytberg

Source :

RBID : PMC:2824148

Abstract

We propose a general approach to compute the seed sensitivity, that can be applied to different definitions of seeds. It treats separately three components of the seed sensitivity problem – a set of target alignments, an associated probability distribution, and a seed model – that are specified by distinct finite automata. The approach is then applied to a new concept of subset seeds for which we propose an efficient automaton construction. Experimental results confirm that sensitive subset seeds can be efficiently designed using our approach, and can then be used in similarity search producing better results than ordinary spaced seeds.


Url:
DOI: 10.1142/S0219720006001977
PubMed: 16819802
PubMed Central: 2824148

Links to Exploration step

PMC:2824148

Le document en format XML

<record>
<TEI>
<teiHeader>
<fileDesc>
<titleStmt>
<title xml:lang="en">A unifying framework for seed sensitivity and its application to subset seeds</title>
<author>
<name sortKey="Kucherov, Gregory" sort="Kucherov, Gregory" uniqKey="Kucherov G" first="Gregory" last="Kucherov">Gregory Kucherov</name>
<affiliation>
<nlm:aff id="A1">LORIA
<institution>INRIA</institution>
<institution>Université Henri Poincaré</institution>
<addr-line>54602 Villers-Les-Nancy,FR</addr-line>
</nlm:aff>
</affiliation>
</author>
<author>
<name sortKey="Noe, Laurent" sort="Noe, Laurent" uniqKey="Noe L" first="Laurent" last="Noé">Laurent Noé</name>
<affiliation>
<nlm:aff id="A1">LORIA
<institution>INRIA</institution>
<institution>Université Henri Poincaré</institution>
<addr-line>54602 Villers-Les-Nancy,FR</addr-line>
</nlm:aff>
</affiliation>
</author>
<author>
<name sortKey="Roytberg, Mihkail" sort="Roytberg, Mihkail" uniqKey="Roytberg M" first="Mihkail" last="Roytberg">Mihkail Roytberg</name>
<affiliation>
<nlm:aff id="A2">IMPB, Institute of Mathematical Problems in Biology
<institution>Russian Academy of Science</institution>
<addr-line>Pushchino, Moscow Region, 142292,RU</addr-line>
</nlm:aff>
</affiliation>
</author>
</titleStmt>
<publicationStmt>
<idno type="wicri:source">PMC</idno>
<idno type="pmid">16819802</idno>
<idno type="pmc">2824148</idno>
<idno type="url">http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2824148</idno>
<idno type="RBID">PMC:2824148</idno>
<idno type="doi">10.1142/S0219720006001977</idno>
<date when="2006">2006</date>
<idno type="wicri:Area/Pmc/Corpus">000073</idno>
<idno type="wicri:explorRef" wicri:stream="Pmc" wicri:step="Corpus" wicri:corpus="PMC">000073</idno>
</publicationStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title xml:lang="en" level="a" type="main">A unifying framework for seed sensitivity and its application to subset seeds</title>
<author>
<name sortKey="Kucherov, Gregory" sort="Kucherov, Gregory" uniqKey="Kucherov G" first="Gregory" last="Kucherov">Gregory Kucherov</name>
<affiliation>
<nlm:aff id="A1">LORIA
<institution>INRIA</institution>
<institution>Université Henri Poincaré</institution>
<addr-line>54602 Villers-Les-Nancy,FR</addr-line>
</nlm:aff>
</affiliation>
</author>
<author>
<name sortKey="Noe, Laurent" sort="Noe, Laurent" uniqKey="Noe L" first="Laurent" last="Noé">Laurent Noé</name>
<affiliation>
<nlm:aff id="A1">LORIA
<institution>INRIA</institution>
<institution>Université Henri Poincaré</institution>
<addr-line>54602 Villers-Les-Nancy,FR</addr-line>
</nlm:aff>
</affiliation>
</author>
<author>
<name sortKey="Roytberg, Mihkail" sort="Roytberg, Mihkail" uniqKey="Roytberg M" first="Mihkail" last="Roytberg">Mihkail Roytberg</name>
<affiliation>
<nlm:aff id="A2">IMPB, Institute of Mathematical Problems in Biology
<institution>Russian Academy of Science</institution>
<addr-line>Pushchino, Moscow Region, 142292,RU</addr-line>
</nlm:aff>
</affiliation>
</author>
</analytic>
<series>
<title level="j">Journal of Bioinformatics and Computational Biology</title>
<idno type="ISSN">0219-7200</idno>
<imprint>
<date when="2006">2006</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc>
<textClass></textClass>
</profileDesc>
</teiHeader>
<front>
<div type="abstract" xml:lang="en">
<p id="P1">We propose a general approach to compute the seed sensitivity, that can be applied to different definitions of seeds. It treats separately three components of the seed sensitivity problem – a set of target alignments, an associated probability distribution, and a seed model – that are specified by distinct finite automata. The approach is then applied to a new concept of
<italic>subset seeds</italic>
for which we propose an efficient automaton construction. Experimental results confirm that sensitive subset seeds can be efficiently designed using our approach, and can then be used in similarity search producing better results than ordinary spaced seeds.</p>
</div>
</front>
</TEI>
<pmc article-type="research-article">
<pmc-comment>The publisher of this article does not allow downloading of the full text in XML form.</pmc-comment>
<pmc-dir>properties manuscript</pmc-dir>
<front>
<journal-meta>
<journal-id journal-id-type="nlm-ta">J Bioinform Comput Biol</journal-id>
<journal-title-group>
<journal-title>Journal of Bioinformatics and Computational Biology</journal-title>
</journal-title-group>
<issn pub-type="ppub">0219-7200</issn>
<publisher>
<publisher-name>Imperial College Press</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="pmid">16819802</article-id>
<article-id pub-id-type="pmc">2824148</article-id>
<article-id pub-id-type="manuscript">HALMS94528</article-id>
<article-id pub-id-type="doi">10.1142/S0219720006001977</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>A unifying framework for seed sensitivity and its application to subset seeds</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname>Kucherov</surname>
<given-names>Gregory</given-names>
</name>
<xref ref-type="aff" rid="A1">1</xref>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Noé</surname>
<given-names>Laurent</given-names>
</name>
<xref ref-type="aff" rid="A1">1</xref>
<xref rid="FN1" ref-type="author-notes">*</xref>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Roytberg</surname>
<given-names>Mihkail</given-names>
</name>
<xref ref-type="aff" rid="A2">2</xref>
<xref rid="FN2" ref-type="author-notes">#</xref>
</contrib>
</contrib-group>
<aff id="A1">
<label>1</label>
LORIA
<institution>INRIA</institution>
<institution>Université Henri Poincaré</institution>
<addr-line>54602 Villers-Les-Nancy,FR</addr-line>
</aff>
<aff id="A2">
<label>2</label>
IMPB, Institute of Mathematical Problems in Biology
<institution>Russian Academy of Science</institution>
<addr-line>Pushchino, Moscow Region, 142292,RU</addr-line>
</aff>
<author-notes>
<corresp id="FN1">* Correspondence should be adressed to: Laurent Noé
<email>laurent.noe@lifl.fr</email>
</corresp>
<fn id="FN2" fn-type="other">
<label>#</label>
<p>part of this work has been done during a visit to LORIA/INRIA in summer 2004</p>
</fn>
</author-notes>
<pub-date pub-type="ppub">
<month>4</month>
<year>2006</year>
</pub-date>
<pub-date pub-type="pmc-release">
<day>18</day>
<month>2</month>
<year>2010</year>
</pub-date>
<volume>4</volume>
<issue>2</issue>
<fpage>553</fpage>
<lpage>569</lpage>
<abstract>
<p id="P1">We propose a general approach to compute the seed sensitivity, that can be applied to different definitions of seeds. It treats separately three components of the seed sensitivity problem – a set of target alignments, an associated probability distribution, and a seed model – that are specified by distinct finite automata. The approach is then applied to a new concept of
<italic>subset seeds</italic>
for which we propose an efficient automaton construction. Experimental results confirm that sensitive subset seeds can be efficiently designed using our approach, and can then be used in similarity search producing better results than ordinary spaced seeds.</p>
</abstract>
<kwd-group kwd-group-type="MESH">
<kwd>Algorithms</kwd>
<kwd>Artificial Intelligence</kwd>
<kwd>Base Sequence</kwd>
<kwd>Molecular Sequence Data</kwd>
<kwd>Pattern Recognition, Automated</kwd>
<kwd>methods</kwd>
<kwd>Reproducibility of Results</kwd>
<kwd>Sensitivity and Specificity</kwd>
<kwd>Sequence Alignment</kwd>
<kwd>methods</kwd>
<kwd>Sequence Analysis, DNA</kwd>
<kwd>methods</kwd>
</kwd-group>
</article-meta>
</front>
</pmc>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Pmc/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000073 | SxmlIndent | more

Ou

HfdSelect -h $EXPLOR_AREA/Data/Pmc/Corpus/biblio.hfd -nk 000073 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Pmc
   |étape=   Corpus
   |type=    RBID
   |clé=     PMC:2824148
   |texte=   A unifying framework for seed sensitivity and its application to subset seeds
}}

Pour générer des pages wiki

HfdIndexSelect -h $EXPLOR_AREA/Data/Pmc/Corpus/RBID.i   -Sk "pubmed:16819802" \
       | HfdSelect -Kh $EXPLOR_AREA/Data/Pmc/Corpus/biblio.hfd   \
       | NlmPubMed2Wicri -a InforLorV4 

Wicri

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022