OpenAccessBelV2, Istex, Corpus, bibRecord, 000C44

Self-overlapping Occurrences and Knuth-Morris-Pratt Algorithm for Weighted Matching

Identifieur interne : 000C44 ( Istex/Corpus ); précédent : 000C43; suivant : 000C45

Self-overlapping Occurrences and Knuth-Morris-Pratt Algorithm for Weighted Matching

Auteurs : Aude Liefooghe ; Hélène Touzet ; Jean-Stéphane Varré

Source :

Lecture Notes in Computer Science [ 0302-9743 ] ; 2009.

RBID : ISTEX:6DBEDD7C70C45CC3E225337C8C7E46B6117F646F

Abstract

Abstract: Position Weight Matrices are broadly used probabilistic motif models. In this paper, we address the problem of identifying and characterizing potential overlaps between occurrences of such a motif. It has useful applications to the statistics of the number of occurrences, and to weighted pattern matching with an extension of the well-known Knuth-Morris-Pratt algorithm.

Url:

https://api.istex.fr/document/6DBEDD7C70C45CC3E225337C8C7E46B6117F646F/fulltext/pdf

DOI: 10.1007/978-3-642-00982-2_41

Links to Exploration step

ISTEX:6DBEDD7C70C45CC3E225337C8C7E46B6117F646F

Le document en format XML

<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Self-overlapping Occurrences and Knuth-Morris-Pratt Algorithm for Weighted Matching</title>
<author><name sortKey="Liefooghe, Aude" sort="Liefooghe, Aude" uniqKey="Liefooghe A" first="Aude" last="Liefooghe">Aude Liefooghe</name>
<affiliation><mods:affiliation>LIFL - UMR CNRS 8022, Université des Sciences et Technologies de Lille, 59655, Villeneuve d’Ascq Cedex, France</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>INRIA Lille Nord-Europe, 59650, Villeneuve d’Ascq, France</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: Aude.Liefooghe@lifl.fr</mods:affiliation>
</affiliation>
</author>
<author><name sortKey="Touzet, Helene" sort="Touzet, Helene" uniqKey="Touzet H" first="Hélène" last="Touzet">Hélène Touzet</name>
<affiliation><mods:affiliation>LIFL - UMR CNRS 8022, Université des Sciences et Technologies de Lille, 59655, Villeneuve d’Ascq Cedex, France</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>INRIA Lille Nord-Europe, 59650, Villeneuve d’Ascq, France</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: Helene.Touzet@lifl.fr</mods:affiliation>
</affiliation>
</author>
<author><name sortKey="Varre, Jean Stephane" sort="Varre, Jean Stephane" uniqKey="Varre J" first="Jean-Stéphane" last="Varré">Jean-Stéphane Varré</name>
<affiliation><mods:affiliation>LIFL - UMR CNRS 8022, Université des Sciences et Technologies de Lille, 59655, Villeneuve d’Ascq Cedex, France</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>INRIA Lille Nord-Europe, 59650, Villeneuve d’Ascq, France</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: Jean-Stephane.Varre@lifl.fr</mods:affiliation>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:6DBEDD7C70C45CC3E225337C8C7E46B6117F646F</idno>
<date when="2009" year="2009">2009</date>
<idno type="doi">10.1007/978-3-642-00982-2_41</idno>
<idno type="url">https://api.istex.fr/document/6DBEDD7C70C45CC3E225337C8C7E46B6117F646F/fulltext/pdf</idno>
<idno type="wicri:Area/Istex/Corpus">000C44</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Self-overlapping Occurrences and Knuth-Morris-Pratt Algorithm for Weighted Matching</title>
<author><name sortKey="Liefooghe, Aude" sort="Liefooghe, Aude" uniqKey="Liefooghe A" first="Aude" last="Liefooghe">Aude Liefooghe</name>
<affiliation><mods:affiliation>LIFL - UMR CNRS 8022, Université des Sciences et Technologies de Lille, 59655, Villeneuve d’Ascq Cedex, France</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>INRIA Lille Nord-Europe, 59650, Villeneuve d’Ascq, France</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: Aude.Liefooghe@lifl.fr</mods:affiliation>
</affiliation>
</author>
<author><name sortKey="Touzet, Helene" sort="Touzet, Helene" uniqKey="Touzet H" first="Hélène" last="Touzet">Hélène Touzet</name>
<affiliation><mods:affiliation>LIFL - UMR CNRS 8022, Université des Sciences et Technologies de Lille, 59655, Villeneuve d’Ascq Cedex, France</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>INRIA Lille Nord-Europe, 59650, Villeneuve d’Ascq, France</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: Helene.Touzet@lifl.fr</mods:affiliation>
</affiliation>
</author>
<author><name sortKey="Varre, Jean Stephane" sort="Varre, Jean Stephane" uniqKey="Varre J" first="Jean-Stéphane" last="Varré">Jean-Stéphane Varré</name>
<affiliation><mods:affiliation>LIFL - UMR CNRS 8022, Université des Sciences et Technologies de Lille, 59655, Villeneuve d’Ascq Cedex, France</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>INRIA Lille Nord-Europe, 59650, Villeneuve d’Ascq, France</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: Jean-Stephane.Varre@lifl.fr</mods:affiliation>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="s">Lecture Notes in Computer Science</title>
<imprint><date>2009</date>
</imprint>
<idno type="ISSN">0302-9743</idno>
<idno type="eISSN">1611-3349</idno>
<idno type="ISSN">0302-9743</idno>
</series>
<idno type="istex">6DBEDD7C70C45CC3E225337C8C7E46B6117F646F</idno>
<idno type="DOI">10.1007/978-3-642-00982-2_41</idno>
<idno type="ChapterID">41</idno>
<idno type="ChapterID">Chap41</idno>
</biblStruct>
</sourceDesc>
<seriesStmt><idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass></textClass>
<langUsage><language ident="en">en</language>
</langUsage>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Abstract: Position Weight Matrices are broadly used probabilistic motif models. In this paper, we address the problem of identifying and characterizing potential overlaps between occurrences of such a motif. It has useful applications to the statistics of the number of occurrences, and to weighted pattern matching with an extension of the well-known Knuth-Morris-Pratt algorithm.</div>
</front>
</TEI>
<istex><corpusName>springer</corpusName>
<author><json:item><name>Aude Liefooghe</name>
<affiliations><json:string>LIFL - UMR CNRS 8022, Université des Sciences et Technologies de Lille, 59655, Villeneuve d’Ascq Cedex, France</json:string>
<json:string>INRIA Lille Nord-Europe, 59650, Villeneuve d’Ascq, France</json:string>
<json:string>E-mail: Aude.Liefooghe@lifl.fr</json:string>
</affiliations>
</json:item>
<json:item><name>Hélène Touzet</name>
<affiliations><json:string>LIFL - UMR CNRS 8022, Université des Sciences et Technologies de Lille, 59655, Villeneuve d’Ascq Cedex, France</json:string>
<json:string>INRIA Lille Nord-Europe, 59650, Villeneuve d’Ascq, France</json:string>
<json:string>E-mail: Helene.Touzet@lifl.fr</json:string>
</affiliations>
</json:item>
<json:item><name>Jean-Stéphane Varré</name>
<affiliations><json:string>LIFL - UMR CNRS 8022, Université des Sciences et Technologies de Lille, 59655, Villeneuve d’Ascq Cedex, France</json:string>
<json:string>INRIA Lille Nord-Europe, 59650, Villeneuve d’Ascq, France</json:string>
<json:string>E-mail: Jean-Stephane.Varre@lifl.fr</json:string>
</affiliations>
</json:item>
</author>
<language><json:string>eng</json:string>
</language>
<originalGenre><json:string>OriginalPaper</json:string>
</originalGenre>
<abstract>Abstract: Position Weight Matrices are broadly used probabilistic motif models. In this paper, we address the problem of identifying and characterizing potential overlaps between occurrences of such a motif. It has useful applications to the statistics of the number of occurrences, and to weighted pattern matching with an extension of the well-known Knuth-Morris-Pratt algorithm.</abstract>
<qualityIndicators><score>7.148</score>
<pdfVersion>1.6</pdfVersion>
<pdfPageSize>430 x 660 pts</pdfPageSize>
<refBibsNative>false</refBibsNative>
<keywordCount>0</keywordCount>
<abstractCharCount>381</abstractCharCount>
<pdfWordCount>5008</pdfWordCount>
<pdfCharCount>23277</pdfCharCount>
<pdfPageCount>12</pdfPageCount>
<abstractWordCount>54</abstractWordCount>
</qualityIndicators>
<title>Self-overlapping Occurrences and Knuth-Morris-Pratt Algorithm for Weighted Matching</title>
<chapterId><json:string>41</json:string>
<json:string>Chap41</json:string>
</chapterId>
<genre><json:string>conference</json:string>
</genre>
<serie><editor><json:item><name>David Hutchison</name>
<affiliations><json:string>Lancaster University, Lancaster, UK</json:string>
</affiliations>
</json:item>
<json:item><name>Takeo Kanade</name>
<affiliations><json:string>Carnegie Mellon University, Pittsburgh, PA, USA</json:string>
</affiliations>
</json:item>
<json:item><name>Josef Kittler</name>
<affiliations><json:string>University of Surrey, Guildford, UK</json:string>
</affiliations>
</json:item>
<json:item><name>Jon M. Kleinberg</name>
<affiliations><json:string>Cornell University, Ithaca, NY, USA</json:string>
</affiliations>
</json:item>
<json:item><name>Friedemann Mattern</name>
<affiliations><json:string>ETH Zurich, Zurich, Switzerland</json:string>
</affiliations>
</json:item>
<json:item><name>John C. Mitchell</name>
<affiliations><json:string>Stanford University, Stanford, CA, USA</json:string>
</affiliations>
</json:item>
<json:item><name>Moni Naor</name>
<affiliations><json:string>Weizmann Institute of Science, Rehovot, Israel</json:string>
</affiliations>
</json:item>
<json:item><name>Oscar Nierstrasz</name>
<affiliations><json:string>University of Bern, Bern, Switzerland</json:string>
</affiliations>
</json:item>
<json:item><name>C. Pandu Rangan</name>
<affiliations><json:string>Indian Institute of Technology, Madras, India</json:string>
</affiliations>
</json:item>
<json:item><name>Bernhard Steffen</name>
<affiliations><json:string>University of Dortmund, Dortmund, Germany</json:string>
</affiliations>
</json:item>
<json:item><name>Madhu Sudan</name>
<affiliations><json:string>Massachusetts Institute of Technology, MA, USA</json:string>
</affiliations>
</json:item>
<json:item><name>Demetri Terzopoulos</name>
<affiliations><json:string>University of California, Los Angeles, CA, USA</json:string>
</affiliations>
</json:item>
<json:item><name>Doug Tygar</name>
<affiliations><json:string>University of California, Berkeley, CA, USA</json:string>
</affiliations>
</json:item>
<json:item><name>Moshe Y. Vardi</name>
<affiliations><json:string>Rice University, Houston, TX, USA</json:string>
</affiliations>
</json:item>
<json:item><name>Gerhard Weikum</name>
<affiliations><json:string>Max-Planck Institute of Computer Science, Saarbrücken, Germany</json:string>
</affiliations>
</json:item>
</editor>
<issn><json:string>0302-9743</json:string>
</issn>
<language><json:string>unknown</json:string>
</language>
<eissn><json:string>1611-3349</json:string>
</eissn>
<title>Lecture Notes in Computer Science</title>
<copyrightDate>2009</copyrightDate>
</serie>
<host><editor><json:item><name>Adrian Horia Dediu</name>
<affiliations><json:string>Research Group on Mathematical Linguistics, Rovira i Virgili University, Av. Catalunya, 35, 43002, Tarragona, Spain</json:string>
<json:string>E-mail: adrian.dediu@urv.cat</json:string>
</affiliations>
</json:item>
<json:item><name>Armand Mihai Ionescu</name>
<affiliations><json:string>Research Group on Mathematical Linguistics, Universitat Rovira i Virgili, Tarragona, Spain</json:string>
<json:string>E-mail: armandmihai.ionescu@urv.cat</json:string>
</affiliations>
</json:item>
<json:item><name>Carlos Martín-Vide</name>
<affiliations><json:string>European Research Council Executive Agency, 16 Place Rogier, 1210, Brussels, Belgium</json:string>
<json:string>E-mail: carlos.martin@urv.cat</json:string>
</affiliations>
</json:item>
</editor>
<subject><json:item><value>Computer Science</value>
</json:item>
<json:item><value>Computer Science</value>
</json:item>
<json:item><value>Mathematical Logic and Formal Languages</value>
</json:item>
<json:item><value>Theory of Computation</value>
</json:item>
<json:item><value>Symbolic and Algebraic Manipulation</value>
</json:item>
<json:item><value>Logics and Meanings of Programs</value>
</json:item>
<json:item><value>Mathematics of Computing</value>
</json:item>
<json:item><value>Computation by Abstract Devices</value>
</json:item>
</subject>
<isbn><json:string>978-3-642-00981-5</json:string>
</isbn>
<language><json:string>unknown</json:string>
</language>
<eissn><json:string>1611-3349</json:string>
</eissn>
<title>Language and Automata Theory and Applications</title>
<bookId><json:string>978-3-642-00982-2</json:string>
</bookId>
<volume>5457</volume>
<pages><last>492</last>
<first>481</first>
</pages>
<issn><json:string>0302-9743</json:string>
</issn>
<genre><json:string>book-series</json:string>
</genre>
<eisbn><json:string>978-3-642-00982-2</json:string>
</eisbn>
<copyrightDate>2009</copyrightDate>
<doi><json:string>10.1007/978-3-642-00982-2</json:string>
</doi>
</host>
<publicationDate>2009</publicationDate>
<copyrightDate>2009</copyrightDate>
<doi><json:string>10.1007/978-3-642-00982-2_41</json:string>
</doi>
<id>6DBEDD7C70C45CC3E225337C8C7E46B6117F646F</id>
<score>0.25915238</score>
<fulltext><json:item><original>true</original>
<mimetype>application/pdf</mimetype>
<extension>pdf</extension>
<uri>https://api.istex.fr/document/6DBEDD7C70C45CC3E225337C8C7E46B6117F646F/fulltext/pdf</uri>
</json:item>
<json:item><original>false</original>
<mimetype>application/zip</mimetype>
<extension>zip</extension>
<uri>https://api.istex.fr/document/6DBEDD7C70C45CC3E225337C8C7E46B6117F646F/fulltext/zip</uri>
</json:item>
<istex:fulltextTEI uri="https://api.istex.fr/document/6DBEDD7C70C45CC3E225337C8C7E46B6117F646F/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Self-overlapping Occurrences and Knuth-Morris-Pratt Algorithm for Weighted Matching</title>
<respStmt><resp>Références bibliographiques récupérées via GROBID</resp>
<name resp="ISTEX-API">ISTEX-API (INIST-CNRS)</name>
</respStmt>
</titleStmt>
<publicationStmt><authority>ISTEX</authority>
<publisher>Springer Berlin Heidelberg</publisher>
<pubPlace>Berlin, Heidelberg</pubPlace>
<availability><p>Springer Berlin Heidelberg, 2009</p>
</availability>
<date>2009</date>
</publicationStmt>
<sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">Self-overlapping Occurrences and Knuth-Morris-Pratt Algorithm for Weighted Matching</title>
<author xml:id="author-1"><persName><forename type="first">Aude</forename>
<surname>Liefooghe</surname>
</persName>
<email>Aude.Liefooghe@lifl.fr</email>
<affiliation>LIFL - UMR CNRS 8022, Université des Sciences et Technologies de Lille, 59655, Villeneuve d’Ascq Cedex, France</affiliation>
<affiliation>INRIA Lille Nord-Europe, 59650, Villeneuve d’Ascq, France</affiliation>
</author>
<author xml:id="author-2"><persName><forename type="first">Hélène</forename>
<surname>Touzet</surname>
</persName>
<email>Helene.Touzet@lifl.fr</email>
<affiliation>LIFL - UMR CNRS 8022, Université des Sciences et Technologies de Lille, 59655, Villeneuve d’Ascq Cedex, France</affiliation>
<affiliation>INRIA Lille Nord-Europe, 59650, Villeneuve d’Ascq, France</affiliation>
</author>
<author xml:id="author-3"><persName><forename type="first">Jean-Stéphane</forename>
<surname>Varré</surname>
</persName>
<email>Jean-Stephane.Varre@lifl.fr</email>
<affiliation>LIFL - UMR CNRS 8022, Université des Sciences et Technologies de Lille, 59655, Villeneuve d’Ascq Cedex, France</affiliation>
<affiliation>INRIA Lille Nord-Europe, 59650, Villeneuve d’Ascq, France</affiliation>
</author>
</analytic>
<monogr><title level="m">Language and Automata Theory and Applications</title>
<title level="m" type="sub">Third International Conference, LATA 2009, Tarragona, Spain, April 2-8, 2009. Proceedings</title>
<idno type="pISBN">978-3-642-00981-5</idno>
<idno type="eISBN">978-3-642-00982-2</idno>
<idno type="pISSN">0302-9743</idno>
<idno type="eISSN">1611-3349</idno>
<idno type="DOI">10.1007/978-3-642-00982-2</idno>
<idno type="book-ID">978-3-642-00982-2</idno>
<idno type="book-title-ID">186551</idno>
<idno type="book-sequence-number">5457</idno>
<idno type="book-volume-number">5457</idno>
<idno type="book-chapter-count">63</idno>
<editor><persName><forename type="first">Adrian</forename>
<forename type="first">Horia</forename>
<surname>Dediu</surname>
</persName>
<email>adrian.dediu@urv.cat</email>
<affiliation>Research Group on Mathematical Linguistics, Rovira i Virgili University, Av. Catalunya, 35, 43002, Tarragona, Spain</affiliation>
</editor>
<editor><persName><forename type="first">Armand</forename>
<forename type="first">Mihai</forename>
<surname>Ionescu</surname>
</persName>
<email>armandmihai.ionescu@urv.cat</email>
<affiliation>Research Group on Mathematical Linguistics, Universitat Rovira i Virgili, Tarragona, Spain</affiliation>
</editor>
<editor><persName><forename type="first">Carlos</forename>
<surname>Martín-Vide</surname>
</persName>
<email>carlos.martin@urv.cat</email>
<affiliation>European Research Council Executive Agency, 16 Place Rogier, 1210, Brussels, Belgium</affiliation>
</editor>
<imprint><publisher>Springer Berlin Heidelberg</publisher>
<pubPlace>Berlin, Heidelberg</pubPlace>
<date type="published" when="2009"></date>
<biblScope unit="volume">5457</biblScope>
<biblScope unit="page" from="481">481</biblScope>
<biblScope unit="page" to="492">492</biblScope>
</imprint>
</monogr>
<series><title level="s">Lecture Notes in Computer Science</title>
<editor><persName><forename type="first">David</forename>
<surname>Hutchison</surname>
</persName>
<affiliation>Lancaster University, Lancaster, UK</affiliation>
</editor>
<editor><persName><forename type="first">Takeo</forename>
<surname>Kanade</surname>
</persName>
<affiliation>Carnegie Mellon University, Pittsburgh, PA, USA</affiliation>
</editor>
<editor><persName><forename type="first">Josef</forename>
<surname>Kittler</surname>
</persName>
<affiliation>University of Surrey, Guildford, UK</affiliation>
</editor>
<editor><persName><forename type="first">Jon</forename>
<forename type="first">M.</forename>
<surname>Kleinberg</surname>
</persName>
<affiliation>Cornell University, Ithaca, NY, USA</affiliation>
</editor>
<editor><persName><forename type="first">Friedemann</forename>
<surname>Mattern</surname>
</persName>
<affiliation>ETH Zurich, Zurich, Switzerland</affiliation>
</editor>
<editor><persName><forename type="first">John</forename>
<forename type="first">C.</forename>
<surname>Mitchell</surname>
</persName>
<affiliation>Stanford University, Stanford, CA, USA</affiliation>
</editor>
<editor><persName><forename type="first">Moni</forename>
<surname>Naor</surname>
</persName>
<affiliation>Weizmann Institute of Science, Rehovot, Israel</affiliation>
</editor>
<editor><persName><forename type="first">Oscar</forename>
<surname>Nierstrasz</surname>
</persName>
<affiliation>University of Bern, Bern, Switzerland</affiliation>
</editor>
<editor><persName><forename type="first">C.</forename>
<surname>Pandu Rangan</surname>
</persName>
<affiliation>Indian Institute of Technology, Madras, India</affiliation>
</editor>
<editor><persName><forename type="first">Bernhard</forename>
<surname>Steffen</surname>
</persName>
<affiliation>University of Dortmund, Dortmund, Germany</affiliation>
</editor>
<editor><persName><forename type="first">Madhu</forename>
<surname>Sudan</surname>
</persName>
<affiliation>Massachusetts Institute of Technology, MA, USA</affiliation>
</editor>
<editor><persName><forename type="first">Demetri</forename>
<surname>Terzopoulos</surname>
</persName>
<affiliation>University of California, Los Angeles, CA, USA</affiliation>
</editor>
<editor><persName><forename type="first">Doug</forename>
<surname>Tygar</surname>
</persName>
<affiliation>University of California, Berkeley, CA, USA</affiliation>
</editor>
<editor><persName><forename type="first">Moshe</forename>
<forename type="first">Y.</forename>
<surname>Vardi</surname>
</persName>
<affiliation>Rice University, Houston, TX, USA</affiliation>
</editor>
<editor><persName><forename type="first">Gerhard</forename>
<surname>Weikum</surname>
</persName>
<affiliation>Max-Planck Institute of Computer Science, Saarbrücken, Germany</affiliation>
</editor>
<biblScope><date>2009</date>
</biblScope>
<idno type="pISSN">0302-9743</idno>
<idno type="eISSN">1611-3349</idno>
<idno type="series-Id">558</idno>
</series>
<idno type="istex">6DBEDD7C70C45CC3E225337C8C7E46B6117F646F</idno>
<idno type="DOI">10.1007/978-3-642-00982-2_41</idno>
<idno type="ChapterID">41</idno>
<idno type="ChapterID">Chap41</idno>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><creation><date>2009</date>
</creation>
<langUsage><language ident="en">en</language>
</langUsage>
<abstract xml:lang="en"><p>Abstract: Position Weight Matrices are broadly used probabilistic motif models. In this paper, we address the problem of identifying and characterizing potential overlaps between occurrences of such a motif. It has useful applications to the statistics of the number of occurrences, and to weighted pattern matching with an extension of the well-known Knuth-Morris-Pratt algorithm.</p>
</abstract>
<textClass><keywords scheme="Book-Subject-Collection"><list><label>SUCO11645</label>
<item><term>Computer Science</term>
</item>
</list>
</keywords>
</textClass>
<textClass><keywords scheme="Book-Subject-Group"><list><label>I</label>
<label>I16048</label>
<label>I16005</label>
<label>I17052</label>
<label>I1603X</label>
<label>I17001</label>
<label>I16013</label>
<item><term>Computer Science</term>
</item>
<item><term>Mathematical Logic and Formal Languages</term>
</item>
<item><term>Theory of Computation</term>
</item>
<item><term>Symbolic and Algebraic Manipulation</term>
</item>
<item><term>Logics and Meanings of Programs</term>
</item>
<item><term>Mathematics of Computing</term>
</item>
<item><term>Computation by Abstract Devices</term>
</item>
</list>
</keywords>
</textClass>
</profileDesc>
<revisionDesc><change when="2009">Published</change>
<change xml:id="refBibs-istex" who="#ISTEX-API" when="2016-09-22">References added</change>
</revisionDesc>
</teiHeader>
</istex:fulltextTEI>
<json:item><original>false</original>
<mimetype>text/plain</mimetype>
<extension>txt</extension>
<uri>https://api.istex.fr/document/6DBEDD7C70C45CC3E225337C8C7E46B6117F646F/fulltext/txt</uri>
</json:item>
</fulltext>
<metadata><istex:metadataXml wicri:clean="Springer, Publisher found" wicri:toSee="no header"><istex:xmlDeclaration>version="1.0" encoding="UTF-8"</istex:xmlDeclaration>
<istex:docType PUBLIC="-//Springer-Verlag//DTD A++ V2.4//EN" URI="http://devel.springer.de/A++/V2.4/DTD/A++V2.4.dtd" name="istex:docType"></istex:docType>
<istex:document><Publisher><PublisherInfo><PublisherName>Springer Berlin Heidelberg</PublisherName>
<PublisherLocation>Berlin, Heidelberg</PublisherLocation>
</PublisherInfo>
<Series><SeriesInfo SeriesType="Series" TocLevels="0"><SeriesID>558</SeriesID>
<SeriesPrintISSN>0302-9743</SeriesPrintISSN>
<SeriesElectronicISSN>1611-3349</SeriesElectronicISSN>
<SeriesTitle Language="En">Lecture Notes in Computer Science</SeriesTitle>
</SeriesInfo>
<SeriesHeader><EditorGroup><Editor AffiliationIDS="Aff1"><EditorName DisplayOrder="Western"><GivenName>David</GivenName>
<FamilyName>Hutchison</FamilyName>
</EditorName>
</Editor>
<Editor AffiliationIDS="Aff2"><EditorName DisplayOrder="Western"><GivenName>Takeo</GivenName>
<FamilyName>Kanade</FamilyName>
</EditorName>
</Editor>
<Editor AffiliationIDS="Aff3"><EditorName DisplayOrder="Western"><GivenName>Josef</GivenName>
<FamilyName>Kittler</FamilyName>
</EditorName>
</Editor>
<Editor AffiliationIDS="Aff4"><EditorName DisplayOrder="Western"><GivenName>Jon</GivenName>
<GivenName>M.</GivenName>
<FamilyName>Kleinberg</FamilyName>
</EditorName>
</Editor>
<Editor AffiliationIDS="Aff5"><EditorName DisplayOrder="Western"><GivenName>Friedemann</GivenName>
<FamilyName>Mattern</FamilyName>
</EditorName>
</Editor>
<Editor AffiliationIDS="Aff6"><EditorName DisplayOrder="Western"><GivenName>John</GivenName>
<GivenName>C.</GivenName>
<FamilyName>Mitchell</FamilyName>
</EditorName>
</Editor>
<Editor AffiliationIDS="Aff7"><EditorName DisplayOrder="Western"><GivenName>Moni</GivenName>
<FamilyName>Naor</FamilyName>
</EditorName>
</Editor>
<Editor AffiliationIDS="Aff8"><EditorName DisplayOrder="Western"><GivenName>Oscar</GivenName>
<FamilyName>Nierstrasz</FamilyName>
</EditorName>
</Editor>
<Editor AffiliationIDS="Aff9"><EditorName DisplayOrder="Western"><GivenName>C.</GivenName>
<FamilyName>Pandu Rangan</FamilyName>
</EditorName>
</Editor>
<Editor AffiliationIDS="Aff10"><EditorName DisplayOrder="Western"><GivenName>Bernhard</GivenName>
<FamilyName>Steffen</FamilyName>
</EditorName>
</Editor>
<Editor AffiliationIDS="Aff11"><EditorName DisplayOrder="Western"><GivenName>Madhu</GivenName>
<FamilyName>Sudan</FamilyName>
</EditorName>
</Editor>
<Editor AffiliationIDS="Aff12"><EditorName DisplayOrder="Western"><GivenName>Demetri</GivenName>
<FamilyName>Terzopoulos</FamilyName>
</EditorName>
</Editor>
<Editor AffiliationIDS="Aff13"><EditorName DisplayOrder="Western"><GivenName>Doug</GivenName>
<FamilyName>Tygar</FamilyName>
</EditorName>
</Editor>
<Editor AffiliationIDS="Aff14"><EditorName DisplayOrder="Western"><GivenName>Moshe</GivenName>
<GivenName>Y.</GivenName>
<FamilyName>Vardi</FamilyName>
</EditorName>
</Editor>
<Editor AffiliationIDS="Aff15"><EditorName DisplayOrder="Western"><GivenName>Gerhard</GivenName>
<FamilyName>Weikum</FamilyName>
</EditorName>
</Editor>
<Affiliation ID="Aff1"><OrgName>Lancaster University</OrgName>
<OrgAddress><City>Lancaster</City>
<Country>UK</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff2"><OrgName>Carnegie Mellon University</OrgName>
<OrgAddress><City>Pittsburgh</City>
<State>PA</State>
<Country>USA</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff3"><OrgName>University of Surrey</OrgName>
<OrgAddress><City>Guildford</City>
<Country>UK</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff4"><OrgName>Cornell University</OrgName>
<OrgAddress><City>Ithaca</City>
<State>NY</State>
<Country>USA</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff5"><OrgName>ETH Zurich</OrgName>
<OrgAddress><City>Zurich</City>
<Country>Switzerland</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff6"><OrgName>Stanford University</OrgName>
<OrgAddress><City>Stanford</City>
<State>CA</State>
<Country>USA</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff7"><OrgName>Weizmann Institute of Science</OrgName>
<OrgAddress><City>Rehovot</City>
<Country>Israel</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff8"><OrgName>University of Bern</OrgName>
<OrgAddress><City>Bern</City>
<Country>Switzerland</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff9"><OrgName>Indian Institute of Technology</OrgName>
<OrgAddress><City>Madras</City>
<Country>India</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff10"><OrgName>University of Dortmund</OrgName>
<OrgAddress><City>Dortmund</City>
<Country>Germany</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff11"><OrgName>Massachusetts Institute of Technology</OrgName>
<OrgAddress><State>MA</State>
<Country>USA</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff12"><OrgName>University of California</OrgName>
<OrgAddress><City>Los Angeles</City>
<State>CA</State>
<Country>USA</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff13"><OrgName>University of California</OrgName>
<OrgAddress><City>Berkeley</City>
<State>CA</State>
<Country>USA</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff14"><OrgName>Rice University</OrgName>
<OrgAddress><City>Houston</City>
<State>TX</State>
<Country>USA</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff15"><OrgName>Max-Planck Institute of Computer Science</OrgName>
<OrgAddress><City>Saarbrücken</City>
<Country>Germany</Country>
</OrgAddress>
</Affiliation>
</EditorGroup>
</SeriesHeader>
<Book Language="En"><BookInfo BookProductType="Proceedings" ContainsESM="No" Language="En" MediaType="eBook" NumberingStyle="Unnumbered" OutputMedium="All" TocLevels="0"><BookID>978-3-642-00982-2</BookID>
<BookTitle>Language and Automata Theory and Applications</BookTitle>
<BookSubTitle>Third International Conference, LATA 2009, Tarragona, Spain, April 2-8, 2009. Proceedings</BookSubTitle>
<BookVolumeNumber>5457</BookVolumeNumber>
<BookSequenceNumber>5457</BookSequenceNumber>
<BookDOI>10.1007/978-3-642-00982-2</BookDOI>
<BookTitleID>186551</BookTitleID>
<BookPrintISBN>978-3-642-00981-5</BookPrintISBN>
<BookElectronicISBN>978-3-642-00982-2</BookElectronicISBN>
<BookChapterCount>63</BookChapterCount>
<BookCopyright><CopyrightHolderName>Springer Berlin Heidelberg</CopyrightHolderName>
<CopyrightYear>2009</CopyrightYear>
</BookCopyright>
<BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject>
<BookSubject Code="I16048" Priority="1" Type="Secondary">Mathematical Logic and Formal Languages</BookSubject>
<BookSubject Code="I16005" Priority="2" Type="Secondary">Theory of Computation</BookSubject>
<BookSubject Code="I17052" Priority="3" Type="Secondary">Symbolic and Algebraic Manipulation</BookSubject>
<BookSubject Code="I1603X" Priority="4" Type="Secondary">Logics and Meanings of Programs</BookSubject>
<BookSubject Code="I17001" Priority="5" Type="Secondary">Mathematics of Computing</BookSubject>
<BookSubject Code="I16013" Priority="6" Type="Secondary">Computation by Abstract Devices</BookSubject>
<SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection>
</BookSubjectGroup>
<BookContext><SeriesID>558</SeriesID>
</BookContext>
</BookInfo>
<BookHeader><EditorGroup><Editor AffiliationIDS="Aff16"><EditorName DisplayOrder="Western"><GivenName>Adrian</GivenName>
<GivenName>Horia</GivenName>
<FamilyName>Dediu</FamilyName>
</EditorName>
<Contact><Email>adrian.dediu@urv.cat</Email>
</Contact>
</Editor>
<Editor AffiliationIDS="Aff17"><EditorName DisplayOrder="Western"><GivenName>Armand</GivenName>
<GivenName>Mihai</GivenName>
<FamilyName>Ionescu</FamilyName>
</EditorName>
<Contact><Email>armandmihai.ionescu@urv.cat</Email>
</Contact>
</Editor>
<Editor AffiliationIDS="Aff18"><EditorName DisplayOrder="Western"><GivenName>Carlos</GivenName>
<FamilyName>Martín-Vide</FamilyName>
</EditorName>
<Contact><Email>carlos.martin@urv.cat</Email>
</Contact>
</Editor>
<Affiliation ID="Aff16"><OrgDivision>Research Group on Mathematical Linguistics</OrgDivision>
<OrgName>Rovira i Virgili University</OrgName>
<OrgAddress><Street>Av. Catalunya, 35</Street>
<Postcode>43002</Postcode>
<City>Tarragona</City>
<Country>Spain</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff17"><OrgDivision>Research Group on Mathematical Linguistics</OrgDivision>
<OrgName>Universitat Rovira i Virgili</OrgName>
<OrgAddress><City>Tarragona</City>
<Country>Spain</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff18"><OrgName>European Research Council Executive Agency</OrgName>
<OrgAddress><Street>16 Place Rogier</Street>
<Postcode>1210</Postcode>
<City>Brussels</City>
<Country>Belgium</Country>
</OrgAddress>
</Affiliation>
</EditorGroup>
</BookHeader>
<Part ID="Part2"><PartInfo TocLevels="0"><PartID>2</PartID>
<PartSequenceNumber>2</PartSequenceNumber>
<PartTitle>Regular Papers</PartTitle>
<PartChapterCount>58</PartChapterCount>
<PartContext><SeriesID>558</SeriesID>
<BookTitle>Language and Automata Theory and Applications</BookTitle>
</PartContext>
</PartInfo>
<Chapter ID="Chap41" Language="En"><ChapterInfo ChapterType="OriginalPaper" ContainsESM="No" NumberingStyle="Unnumbered" TocLevels="0"><ChapterID>41</ChapterID>
<ChapterDOI>10.1007/978-3-642-00982-2_41</ChapterDOI>
<ChapterSequenceNumber>41</ChapterSequenceNumber>
<ChapterTitle Language="En">Self-overlapping Occurrences and Knuth-Morris-Pratt Algorithm for Weighted Matching</ChapterTitle>
<ChapterFirstPage>481</ChapterFirstPage>
<ChapterLastPage>492</ChapterLastPage>
<ChapterCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName>
<CopyrightYear>2009</CopyrightYear>
</ChapterCopyright>
<ChapterGrants Type="Regular"><MetadataGrant Grant="OpenAccess"></MetadataGrant>
<AbstractGrant Grant="OpenAccess"></AbstractGrant>
<BodyPDFGrant Grant="Restricted"></BodyPDFGrant>
<BodyHTMLGrant Grant="Restricted"></BodyHTMLGrant>
<BibliographyGrant Grant="Restricted"></BibliographyGrant>
<ESMGrant Grant="Restricted"></ESMGrant>
</ChapterGrants>
<ChapterContext><SeriesID>558</SeriesID>
<PartID>2</PartID>
<BookID>978-3-642-00982-2</BookID>
<BookTitle>Language and Automata Theory and Applications</BookTitle>
</ChapterContext>
</ChapterInfo>
<ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff19 Aff20"><AuthorName DisplayOrder="Western"><GivenName>Aude</GivenName>
<FamilyName>Liefooghe</FamilyName>
</AuthorName>
<Contact><Email>Aude.Liefooghe@lifl.fr</Email>
</Contact>
</Author>
<Author AffiliationIDS="Aff19 Aff20"><AuthorName DisplayOrder="Western"><GivenName>Hélène</GivenName>
<FamilyName>Touzet</FamilyName>
</AuthorName>
<Contact><Email>Helene.Touzet@lifl.fr</Email>
</Contact>
</Author>
<Author AffiliationIDS="Aff19 Aff20"><AuthorName DisplayOrder="Western"><GivenName>Jean-Stéphane</GivenName>
<FamilyName>Varré</FamilyName>
</AuthorName>
<Contact><Email>Jean-Stephane.Varre@lifl.fr</Email>
</Contact>
</Author>
<Affiliation ID="Aff19"><OrgDivision>LIFL - UMR CNRS 8022</OrgDivision>
<OrgName>Université des Sciences et Technologies de Lille</OrgName>
<OrgAddress><Postcode>59655</Postcode>
<City>Villeneuve d’Ascq Cedex</City>
<Country>France</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff20"><OrgName>INRIA Lille Nord-Europe</OrgName>
<OrgAddress><Postcode>59650</Postcode>
<City>Villeneuve d’Ascq</City>
<Country>France</Country>
</OrgAddress>
</Affiliation>
</AuthorGroup>
<Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading>
<Para>Position Weight Matrices are broadly used probabilistic motif models. In this paper, we address the problem of identifying and characterizing potential overlaps between occurrences of such a motif. It has useful applications to the statistics of the number of occurrences, and to weighted pattern matching with an extension of the well-known Knuth-Morris-Pratt algorithm.</Para>
</Abstract>
</ChapterHeader>
<NoBody></NoBody>
</Chapter>
</Part>
</Book>
</Series>
</Publisher>
</istex:document>
</istex:metadataXml>
<mods version="3.6"><titleInfo lang="en"><title>Self-overlapping Occurrences and Knuth-Morris-Pratt Algorithm for Weighted Matching</title>
</titleInfo>
<titleInfo type="alternative" contentType="CDATA" lang="en"><title>Self-overlapping Occurrences and Knuth-Morris-Pratt Algorithm for Weighted Matching</title>
</titleInfo>
<name type="personal"><namePart type="given">Aude</namePart>
<namePart type="family">Liefooghe</namePart>
<affiliation>LIFL - UMR CNRS 8022, Université des Sciences et Technologies de Lille, 59655, Villeneuve d’Ascq Cedex, France</affiliation>
<affiliation>INRIA Lille Nord-Europe, 59650, Villeneuve d’Ascq, France</affiliation>
<affiliation>E-mail: Aude.Liefooghe@lifl.fr</affiliation>
<role><roleTerm type="text">author</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Hélène</namePart>
<namePart type="family">Touzet</namePart>
<affiliation>LIFL - UMR CNRS 8022, Université des Sciences et Technologies de Lille, 59655, Villeneuve d’Ascq Cedex, France</affiliation>
<affiliation>INRIA Lille Nord-Europe, 59650, Villeneuve d’Ascq, France</affiliation>
<affiliation>E-mail: Helene.Touzet@lifl.fr</affiliation>
<role><roleTerm type="text">author</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Jean-Stéphane</namePart>
<namePart type="family">Varré</namePart>
<affiliation>LIFL - UMR CNRS 8022, Université des Sciences et Technologies de Lille, 59655, Villeneuve d’Ascq Cedex, France</affiliation>
<affiliation>INRIA Lille Nord-Europe, 59650, Villeneuve d’Ascq, France</affiliation>
<affiliation>E-mail: Jean-Stephane.Varre@lifl.fr</affiliation>
<role><roleTerm type="text">author</roleTerm>
</role>
</name>
<typeOfResource>text</typeOfResource>
<genre type="conference" displayLabel="OriginalPaper"></genre>
<originInfo><publisher>Springer Berlin Heidelberg</publisher>
<place><placeTerm type="text">Berlin, Heidelberg</placeTerm>
</place>
<dateIssued encoding="w3cdtf">2009</dateIssued>
<copyrightDate encoding="w3cdtf">2009</copyrightDate>
</originInfo>
<language><languageTerm type="code" authority="rfc3066">en</languageTerm>
<languageTerm type="code" authority="iso639-2b">eng</languageTerm>
</language>
<physicalDescription><internetMediaType>text/html</internetMediaType>
</physicalDescription>
<abstract lang="en">Abstract: Position Weight Matrices are broadly used probabilistic motif models. In this paper, we address the problem of identifying and characterizing potential overlaps between occurrences of such a motif. It has useful applications to the statistics of the number of occurrences, and to weighted pattern matching with an extension of the well-known Knuth-Morris-Pratt algorithm.</abstract>
<relatedItem type="host"><titleInfo><title>Language and Automata Theory and Applications</title>
<subTitle>Third International Conference, LATA 2009, Tarragona, Spain, April 2-8, 2009. Proceedings</subTitle>
</titleInfo>
<name type="personal"><namePart type="given">Adrian</namePart>
<namePart type="given">Horia</namePart>
<namePart type="family">Dediu</namePart>
<affiliation>Research Group on Mathematical Linguistics, Rovira i Virgili University, Av. Catalunya, 35, 43002, Tarragona, Spain</affiliation>
<affiliation>E-mail: adrian.dediu@urv.cat</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Armand</namePart>
<namePart type="given">Mihai</namePart>
<namePart type="family">Ionescu</namePart>
<affiliation>Research Group on Mathematical Linguistics, Universitat Rovira i Virgili, Tarragona, Spain</affiliation>
<affiliation>E-mail: armandmihai.ionescu@urv.cat</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Carlos</namePart>
<namePart type="family">Martín-Vide</namePart>
<affiliation>European Research Council Executive Agency, 16 Place Rogier, 1210, Brussels, Belgium</affiliation>
<affiliation>E-mail: carlos.martin@urv.cat</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<genre type="book-series" displayLabel="Proceedings"></genre>
<originInfo><copyrightDate encoding="w3cdtf">2009</copyrightDate>
<issuance>monographic</issuance>
</originInfo>
<subject><genre>Book-Subject-Collection</genre>
<topic authority="SpringerSubjectCodes" authorityURI="SUCO11645">Computer Science</topic>
</subject>
<subject><genre>Book-Subject-Group</genre>
<topic authority="SpringerSubjectCodes" authorityURI="I">Computer Science</topic>
<topic authority="SpringerSubjectCodes" authorityURI="I16048">Mathematical Logic and Formal Languages</topic>
<topic authority="SpringerSubjectCodes" authorityURI="I16005">Theory of Computation</topic>
<topic authority="SpringerSubjectCodes" authorityURI="I17052">Symbolic and Algebraic Manipulation</topic>
<topic authority="SpringerSubjectCodes" authorityURI="I1603X">Logics and Meanings of Programs</topic>
<topic authority="SpringerSubjectCodes" authorityURI="I17001">Mathematics of Computing</topic>
<topic authority="SpringerSubjectCodes" authorityURI="I16013">Computation by Abstract Devices</topic>
</subject>
<identifier type="DOI">10.1007/978-3-642-00982-2</identifier>
<identifier type="ISBN">978-3-642-00981-5</identifier>
<identifier type="eISBN">978-3-642-00982-2</identifier>
<identifier type="ISSN">0302-9743</identifier>
<identifier type="eISSN">1611-3349</identifier>
<identifier type="BookTitleID">186551</identifier>
<identifier type="BookID">978-3-642-00982-2</identifier>
<identifier type="BookChapterCount">63</identifier>
<identifier type="BookVolumeNumber">5457</identifier>
<identifier type="BookSequenceNumber">5457</identifier>
<identifier type="PartChapterCount">58</identifier>
<part><date>2009</date>
<detail type="part"><title>Regular Papers</title>
</detail>
<detail type="volume"><number>5457</number>
<caption>vol.</caption>
</detail>
<extent unit="pages"><start>481</start>
<end>492</end>
</extent>
</part>
<recordInfo><recordOrigin>Springer Berlin Heidelberg, 2009</recordOrigin>
</recordInfo>
</relatedItem>
<relatedItem type="series"><titleInfo><title>Lecture Notes in Computer Science</title>
</titleInfo>
<name type="personal"><namePart type="given">David</namePart>
<namePart type="family">Hutchison</namePart>
<affiliation>Lancaster University, Lancaster, UK</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Takeo</namePart>
<namePart type="family">Kanade</namePart>
<affiliation>Carnegie Mellon University, Pittsburgh, PA, USA</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Josef</namePart>
<namePart type="family">Kittler</namePart>
<affiliation>University of Surrey, Guildford, UK</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Jon</namePart>
<namePart type="given">M.</namePart>
<namePart type="family">Kleinberg</namePart>
<affiliation>Cornell University, Ithaca, NY, USA</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Friedemann</namePart>
<namePart type="family">Mattern</namePart>
<affiliation>ETH Zurich, Zurich, Switzerland</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">John</namePart>
<namePart type="given">C.</namePart>
<namePart type="family">Mitchell</namePart>
<affiliation>Stanford University, Stanford, CA, USA</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Moni</namePart>
<namePart type="family">Naor</namePart>
<affiliation>Weizmann Institute of Science, Rehovot, Israel</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Oscar</namePart>
<namePart type="family">Nierstrasz</namePart>
<affiliation>University of Bern, Bern, Switzerland</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">C.</namePart>
<namePart type="family">Pandu Rangan</namePart>
<affiliation>Indian Institute of Technology, Madras, India</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Bernhard</namePart>
<namePart type="family">Steffen</namePart>
<affiliation>University of Dortmund, Dortmund, Germany</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Madhu</namePart>
<namePart type="family">Sudan</namePart>
<affiliation>Massachusetts Institute of Technology, MA, USA</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Demetri</namePart>
<namePart type="family">Terzopoulos</namePart>
<affiliation>University of California, Los Angeles, CA, USA</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Doug</namePart>
<namePart type="family">Tygar</namePart>
<affiliation>University of California, Berkeley, CA, USA</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Moshe</namePart>
<namePart type="given">Y.</namePart>
<namePart type="family">Vardi</namePart>
<affiliation>Rice University, Houston, TX, USA</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Gerhard</namePart>
<namePart type="family">Weikum</namePart>
<affiliation>Max-Planck Institute of Computer Science, Saarbrücken, Germany</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<originInfo><copyrightDate encoding="w3cdtf">2009</copyrightDate>
<issuance>serial</issuance>
</originInfo>
<identifier type="ISSN">0302-9743</identifier>
<identifier type="eISSN">1611-3349</identifier>
<identifier type="SeriesID">558</identifier>
<recordInfo><recordOrigin>Springer Berlin Heidelberg, 2009</recordOrigin>
</recordInfo>
</relatedItem>
<identifier type="istex">6DBEDD7C70C45CC3E225337C8C7E46B6117F646F</identifier>
<identifier type="DOI">10.1007/978-3-642-00982-2_41</identifier>
<identifier type="ChapterID">41</identifier>
<identifier type="ChapterID">Chap41</identifier>
<accessCondition type="use and reproduction" contentType="copyright">Springer Berlin Heidelberg, 2009</accessCondition>
<recordInfo><recordContentSource>SPRINGER</recordContentSource>
<recordOrigin>Springer-Verlag Berlin Heidelberg, 2009</recordOrigin>
</recordInfo>
</mods>
</metadata>
<enrichments><json:item><type>multicat</type>
<uri>https://api.istex.fr/document/6DBEDD7C70C45CC3E225337C8C7E46B6117F646F/enrichments/multicat</uri>
</json:item>
<istex:refBibTEI uri="https://api.istex.fr/document/6DBEDD7C70C45CC3E225337C8C7E46B6117F646F/enrichments/refBib"><teiHeader></teiHeader>
<text><front></front>
<body></body>
<back><listBibl><biblStruct xml:id="b0"><analytic><title level="a" type="main">A catalogue of splice junction sequences</title>
<author><persName><forename type="first">S</forename>
<surname>Mount</surname>
</persName>
</author>
</analytic>
<monogr><title level="j">Nucleic Acids Research</title>
<imprint><biblScope unit="volume">10</biblScope>
<biblScope unit="page" from="459" to="472"></biblScope>
<date type="published" when="1982"></date>
</imprint>
</monogr>
</biblStruct>
<biblStruct xml:id="b1"><analytic><title level="a" type="main">Recent improvements to the PROSITE database</title>
<author><persName><forename type="first">N</forename>
<surname>Hulo</surname>
</persName>
</author>
<author><persName><forename type="first">C</forename>
<surname>Sigrist</surname>
</persName>
</author>
<author><persName><forename type="first">V</forename>
<forename type="middle">L</forename>
<surname>Saux</surname>
</persName>
</author>
<author><persName><forename type="first">P</forename>
<surname>Langendijk-Genevaux</surname>
</persName>
</author>
<author><persName><forename type="first">L</forename>
<surname>Bordoli1</surname>
</persName>
</author>
<author><persName><forename type="first">A</forename>
<surname>Gattiker</surname>
</persName>
</author>
<author><persName><forename type="first">E</forename>
<forename type="middle">D</forename>
<surname>Castro</surname>
</persName>
</author>
<author><persName><forename type="first">P</forename>
<surname>Bucher</surname>
</persName>
</author>
<author><persName><forename type="first">A</forename>
<surname>Bairoch</surname>
</persName>
</author>
</analytic>
<monogr><title level="j">Nucleic Acids Research</title>
<imprint><biblScope unit="volume">32</biblScope>
<biblScope unit="page" from="134" to="137"></biblScope>
<date type="published" when="2004"></date>
</imprint>
</monogr>
</biblStruct>
<biblStruct xml:id="b2"><analytic><title></title>
<author><persName><forename type="first">W</forename>
<surname>Ewens</surname>
</persName>
</author>
<author><persName><forename type="first">G</forename>
<surname>Grant</surname>
</persName>
</author>
</analytic>
<monogr><title level="m">Statistical Methods in Bioinformatics</title>
<meeting><address><addrLine>Heidelberg</addrLine>
</address>
</meeting>
<imprint><publisher>Springer</publisher>
<date type="published" when="2005"></date>
</imprint>
</monogr>
</biblStruct>
<biblStruct xml:id="b3"><analytic><title level="a" type="main">Compound poisson approximation of the number of occurrences of a position frequency matrix (PFM) on both strands</title>
<author><persName><forename type="first">U</forename>
<surname>Pape</surname>
</persName>
</author>
<author><persName><forename type="first">S</forename>
<surname>Rahmann</surname>
</persName>
</author>
<author><persName><forename type="first">F</forename>
<surname>Sun</surname>
</persName>
</author>
<author><persName><forename type="first">M</forename>
<surname>Vingron</surname>
</persName>
</author>
</analytic>
<monogr><title level="j">Journal of Computation Biology</title>
<imprint><biblScope unit="volume">15</biblScope>
<biblScope unit="page" from="547" to="564"></biblScope>
<date type="published" when="2008"></date>
</imprint>
</monogr>
</biblStruct>
<biblStruct xml:id="b4"><analytic><title level="a" type="main">Fast pattern matching in strings</title>
<author><persName><forename type="first">D</forename>
<surname>Knuth</surname>
</persName>
</author>
<author><persName><forename type="first">Morris</forename>
<surname>Jr</surname>
</persName>
</author>
<author><persName><forename type="first">J</forename>
<surname>Pratt</surname>
</persName>
</author>
<author><persName><forename type="first">V</forename>
</persName>
</author>
</analytic>
<monogr><title level="j">SIAM Journal on Computing</title>
<imprint><date type="published" when="1977"></date>
</imprint>
</monogr>
</biblStruct>
<biblStruct xml:id="b5"><analytic><title level="a" type="main">A fast string searching algorithm</title>
<author><persName><forename type="first">R</forename>
<forename type="middle">S</forename>
<surname>Boyer</surname>
</persName>
</author>
<author><persName><forename type="first">J</forename>
<forename type="middle">S</forename>
<surname>Moore</surname>
</persName>
</author>
</analytic>
<monogr><title level="j">Commun. ACM</title>
<imprint><biblScope unit="volume">20</biblScope>
<biblScope unit="page" from="762" to="772"></biblScope>
<date type="published" when="1977"></date>
</imprint>
</monogr>
</biblStruct>
<biblStruct xml:id="b6"><analytic><title level="a" type="main">Efficient string matching: an aid to bibliographic search</title>
<author><persName><forename type="first">A</forename>
<surname>Aho</surname>
</persName>
</author>
<author><persName><forename type="first">M</forename>
<surname>Corasick</surname>
</persName>
</author>
</analytic>
<monogr><title level="j">Communications of the ACM</title>
<imprint><date type="published" when="1975"></date>
</imprint>
</monogr>
</biblStruct>
<biblStruct xml:id="b7"><analytic><title level="a" type="main">Jaspar: an open-access database for eukaryotic transcription factor binding profiles</title>
<author><persName><forename type="first">A</forename>
<surname>Sandelin</surname>
</persName>
</author>
<author><persName><forename type="first">W</forename>
<surname>Alkema</surname>
</persName>
</author>
<author><persName><forename type="first">P</forename>
<surname>Engström</surname>
</persName>
</author>
<author><persName><forename type="first">W</forename>
<surname>Wasserman</surname>
</persName>
</author>
</analytic>
<monogr><title level="j">Nucleic Acids Research</title>
<imprint><date type="published" when="2004"></date>
</imprint>
</monogr>
</biblStruct>
<biblStruct xml:id="b8"><analytic><title level="a" type="main">Fast probabilistic analysis of sequence function using scoring matrices</title>
<author><persName><forename type="first">T</forename>
<forename type="middle">D</forename>
<surname>Wu</surname>
</persName>
</author>
<author><persName><forename type="first">C</forename>
<forename type="middle">G</forename>
<surname>Manning</surname>
</persName>
</author>
<author><persName><forename type="first">D</forename>
<forename type="middle">L</forename>
<surname>Brutlag</surname>
</persName>
</author>
</analytic>
<monogr><title level="j">Bioinformatics</title>
<imprint><biblScope unit="volume">16</biblScope>
<biblScope unit="page" from="233" to="244"></biblScope>
<date type="published" when="2000"></date>
</imprint>
</monogr>
</biblStruct>
<biblStruct xml:id="b9"><analytic><title level="a" type="main">Methods for calculating the probabilities of finding patterns in sequences</title>
<author><persName><forename type="first">R</forename>
<surname>Staden</surname>
</persName>
</author>
</analytic>
<monogr><title level="j">Comput. Appl. Biosci</title>
<imprint><biblScope unit="volume">5</biblScope>
<biblScope unit="page" from="89" to="96"></biblScope>
<date type="published" when="1989"></date>
</imprint>
</monogr>
</biblStruct>
<biblStruct xml:id="b10"><analytic><title level="a" type="main">Efficient and accurate p-value computation for position weight matrices</title>
<author><persName><forename type="first">H</forename>
<surname>Touzet</surname>
</persName>
</author>
<author><persName><forename type="first">J</forename>
<forename type="middle">S</forename>
<surname>Varré</surname>
</persName>
</author>
</analytic>
<monogr><title level="j">Algorithms for Molecular Biology</title>
<imprint><biblScope unit="volume">2</biblScope>
<date type="published" when="2007"></date>
</imprint>
</monogr>
</biblStruct>
<biblStruct xml:id="b11"><analytic><title level="a" type="main">Large scale matching for position weight matrices</title>
<author><persName><forename type="first">A</forename>
<surname>Liefooghe</surname>
</persName>
</author>
<author><persName><forename type="first">H</forename>
<surname>Touzet</surname>
</persName>
</author>
<author><persName><forename type="first">J</forename>
<forename type="middle">S</forename>
<surname>Varré</surname>
</persName>
</author>
</analytic>
<monogr><title level="m">CPM 2006</title>
<editor>Lewenstein, M., Valiente, G.</editor>
<meeting><address><addrLine>Heidelberg</addrLine>
</address>
</meeting>
<imprint><publisher>Springer</publisher>
<date type="published" when="2006"></date>
<biblScope unit="page" from="401" to="412"></biblScope>
</imprint>
</monogr>
</biblStruct>
<biblStruct xml:id="b12"><analytic><title level="a" type="main">Fast index based algorithms and software for matching position specific scoring matrices</title>
<author><persName><forename type="first">M</forename>
<surname>Beckstette</surname>
</persName>
</author>
<author><persName><forename type="first">R</forename>
<surname>Homann</surname>
</persName>
</author>
<author><persName><forename type="first">R</forename>
<surname>Giegerich</surname>
</persName>
</author>
<author><persName><forename type="first">S</forename>
<surname>Kurtz</surname>
</persName>
</author>
</analytic>
<monogr><title level="j">BMC Bioinformatics</title>
<imprint><date type="published" when="2006"></date>
</imprint>
</monogr>
</biblStruct>
<biblStruct xml:id="b13"><analytic><title level="a" type="main">Fast search algorithms for position specific scoring matrices</title>
<author><persName><forename type="first">C</forename>
<surname>Pizzi</surname>
</persName>
</author>
<author><persName><forename type="first">P</forename>
<surname>Rastas</surname>
</persName>
</author>
<author><persName><forename type="first">E</forename>
<surname>Ukkonen</surname>
</persName>
</author>
</analytic>
<monogr><title level="m">BIRD 2007</title>
<editor>Hochreiter, S., Wagner, R.</editor>
<meeting><address><addrLine>Heidelberg</addrLine>
</address>
</meeting>
<imprint><publisher>Springer</publisher>
<date type="published" when="2007"></date>
<biblScope unit="page" from="239" to="250"></biblScope>
</imprint>
</monogr>
</biblStruct>
<biblStruct xml:id="b14"><analytic><title level="a" type="main">Algorithms for weighted matching</title>
<author><persName><forename type="first">L</forename>
<surname>Salmela</surname>
</persName>
</author>
<author><persName><forename type="first">J</forename>
<surname>Tarhio</surname>
</persName>
</author>
</analytic>
<monogr><title level="m">SPIRE 2007</title>
<editor>Ziviani, N., Baeza- Yates, R.</editor>
<meeting><address><addrLine>Heidelberg</addrLine>
</address>
</meeting>
<imprint><publisher>Springer</publisher>
<date type="published" when="2007"></date>
<biblScope unit="page" from="276" to="286"></biblScope>
</imprint>
</monogr>
</biblStruct>
</listBibl>
</back>
</text>
</istex:refBibTEI>
<json:item><type>refBibs</type>
<uri>https://api.istex.fr/document/6DBEDD7C70C45CC3E225337C8C7E46B6117F646F/enrichments/refBibs</uri>
</json:item>
</enrichments>
</istex>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Belgique/explor/OpenAccessBelV2/Data/Istex/Corpus

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000C44 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 000C44 | SxmlIndent | more

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

{{Explor lien
   |wiki=    Wicri/Belgique
   |area=    OpenAccessBelV2
   |flux=    Istex
   |étape=   Corpus
   |type=    RBID
   |clé=     ISTEX:6DBEDD7C70C45CC3E225337C8C7E46B6117F646F
   |texte=   Self-overlapping Occurrences and Knuth-Morris-Pratt Algorithm for Weighted Matching
}}

This area was generated with Dilib version V0.6.25.
Data generation: Thu Dec 1 00:43:49 2016. Site generation: Wed Mar 6 14:51:30 2024

	Serveur d'exploration autour du libre accès en Belgique
	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.

Serveur d'exploration autour du libre accès en Belgique

Self-overlapping Occurrences and Knuth-Morris-Pratt Algorithm for Weighted Matching

Self-overlapping Occurrences and Knuth-Morris-Pratt Algorithm for Weighted Matching

Source :

Abstract

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

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