Identifying Occurrences of Maximal Pairs in Multiple Strings
A molecular sequence “model” is a (structured) sequence of distinct or identical strings separated by gaps; here we design and analyze efficient algorithms for variations of the “Model Matching” and “Model Identification” problems.
Gespeichert in:
| Hauptverfasser: | , , , , |
|---|---|
| Format: | Buchkapitel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 143 |
|---|---|
| container_issue | |
| container_start_page | 133 |
| container_title | |
| container_volume | 2373 |
| creator | Iliopoulos, Costas S. Makris, Christos Sioutas, Spiros Tsakalidis, Athanasios Tsichlas, Kostas |
| description | A molecular sequence “model” is a (structured) sequence of distinct or identical strings separated by gaps; here we design and analyze efficient algorithms for variations of the “Model Matching” and “Model Identification” problems. |
| doi_str_mv | 10.1007/3-540-45452-7_12 |
| format | Book Chapter |
| fullrecord | <record><control><sourceid>proquest_pasca</sourceid><recordid>TN_cdi_pascalfrancis_primary_14655239</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>EBC3071972_18_141</sourcerecordid><originalsourceid>FETCH-LOGICAL-p268t-2e9ca98371e00c3e1072be79612a44c064d86092f277f158d2ab82b66ba4d6ed3</originalsourceid><addsrcrecordid>eNotkElPwzAQhc0qSumdYy4cXTy240XigiqWSq2KBJwtx3EgENJgpxL99zht5zLSmzdvRh9C10CmQIi8ZTjnBPOc5xRLA_QITbRULIk7TRyjEQgAzBjXJ-hyN2BKUH2KRoQRirXk7HwwCS4EleoCTWL8IqkYBQ1yhO7mpW_7utrW7Ue2cm4Tgm-dj9m6ypb2r_6xTfZi6xCzus2Wm6avu8Znr31I_niFzirbRD859DF6f3x4mz3jxeppPrtf4I4K1WPqtbNaMQmeEMc8EEkLL7UAajl3RPBSCaJpRaWsIFcltYWihRCF5aXwJRujm31uZ6OzTRVs6-poupDeC1sDXOQ5ZTr5pntf7Ib_fDDFev0dDRAz8DTMJEJmx84MPNMCOwSH9e_Gx974YcMlJME27tN2vQ_RMCJBS2pApVvA_gGF1XFv</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>book_chapter</recordtype><pqid>EBC3071972_18_141</pqid></control><display><type>book_chapter</type><title>Identifying Occurrences of Maximal Pairs in Multiple Strings</title><source>Springer Books</source><creator>Iliopoulos, Costas S. ; Makris, Christos ; Sioutas, Spiros ; Tsakalidis, Athanasios ; Tsichlas, Kostas</creator><contributor>Apostolico, Alberto ; Takeda, Masayuki ; Apostolico, Alberto ; Takeda, Masayuki</contributor><creatorcontrib>Iliopoulos, Costas S. ; Makris, Christos ; Sioutas, Spiros ; Tsakalidis, Athanasios ; Tsichlas, Kostas ; Apostolico, Alberto ; Takeda, Masayuki ; Apostolico, Alberto ; Takeda, Masayuki</creatorcontrib><description>A molecular sequence “model” is a (structured) sequence of distinct or identical strings separated by gaps; here we design and analyze efficient algorithms for variations of the “Model Matching” and “Model Identification” problems.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 3540438629</identifier><identifier>ISBN: 9783540438625</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 9783540454526</identifier><identifier>EISBN: 3540454527</identifier><identifier>DOI: 10.1007/3-540-45452-7_12</identifier><identifier>OCLC: 166466278</identifier><identifier>LCCallNum: QA297.4</identifier><language>eng</language><publisher>Germany: Springer Berlin / Heidelberg</publisher><subject>Algorithmics. Computability. Computer arithmetics ; Applied sciences ; Computer science; control theory; systems ; DNA Matching ; Exact sciences and technology ; Search Trees ; String Algorithms ; Theoretical computing</subject><ispartof>Combinatorial Pattern Matching, 2002, Vol.2373, p.133-143</ispartof><rights>Springer-Verlag Berlin Heidelberg 2002</rights><rights>2003 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><relation>Lecture Notes in Computer Science</relation></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Uhttps://ebookcentral.proquest.com/covers/3071972-l.jpg</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/3-540-45452-7_12$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/3-540-45452-7_12$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,779,780,784,789,790,793,27925,38255,41442,42511</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=14655239$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Apostolico, Alberto</contributor><contributor>Takeda, Masayuki</contributor><contributor>Apostolico, Alberto</contributor><contributor>Takeda, Masayuki</contributor><creatorcontrib>Iliopoulos, Costas S.</creatorcontrib><creatorcontrib>Makris, Christos</creatorcontrib><creatorcontrib>Sioutas, Spiros</creatorcontrib><creatorcontrib>Tsakalidis, Athanasios</creatorcontrib><creatorcontrib>Tsichlas, Kostas</creatorcontrib><title>Identifying Occurrences of Maximal Pairs in Multiple Strings</title><title>Combinatorial Pattern Matching</title><description>A molecular sequence “model” is a (structured) sequence of distinct or identical strings separated by gaps; here we design and analyze efficient algorithms for variations of the “Model Matching” and “Model Identification” problems.</description><subject>Algorithmics. Computability. Computer arithmetics</subject><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>DNA Matching</subject><subject>Exact sciences and technology</subject><subject>Search Trees</subject><subject>String Algorithms</subject><subject>Theoretical computing</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>3540438629</isbn><isbn>9783540438625</isbn><isbn>9783540454526</isbn><isbn>3540454527</isbn><fulltext>true</fulltext><rsrctype>book_chapter</rsrctype><creationdate>2002</creationdate><recordtype>book_chapter</recordtype><recordid>eNotkElPwzAQhc0qSumdYy4cXTy240XigiqWSq2KBJwtx3EgENJgpxL99zht5zLSmzdvRh9C10CmQIi8ZTjnBPOc5xRLA_QITbRULIk7TRyjEQgAzBjXJ-hyN2BKUH2KRoQRirXk7HwwCS4EleoCTWL8IqkYBQ1yhO7mpW_7utrW7Ue2cm4Tgm-dj9m6ypb2r_6xTfZi6xCzus2Wm6avu8Znr31I_niFzirbRD859DF6f3x4mz3jxeppPrtf4I4K1WPqtbNaMQmeEMc8EEkLL7UAajl3RPBSCaJpRaWsIFcltYWihRCF5aXwJRujm31uZ6OzTRVs6-poupDeC1sDXOQ5ZTr5pntf7Ib_fDDFev0dDRAz8DTMJEJmx84MPNMCOwSH9e_Gx974YcMlJME27tN2vQ_RMCJBS2pApVvA_gGF1XFv</recordid><startdate>20020101</startdate><enddate>20020101</enddate><creator>Iliopoulos, Costas S.</creator><creator>Makris, Christos</creator><creator>Sioutas, Spiros</creator><creator>Tsakalidis, Athanasios</creator><creator>Tsichlas, Kostas</creator><general>Springer Berlin / Heidelberg</general><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>FFUUA</scope><scope>IQODW</scope></search><sort><creationdate>20020101</creationdate><title>Identifying Occurrences of Maximal Pairs in Multiple Strings</title><author>Iliopoulos, Costas S. ; Makris, Christos ; Sioutas, Spiros ; Tsakalidis, Athanasios ; Tsichlas, Kostas</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p268t-2e9ca98371e00c3e1072be79612a44c064d86092f277f158d2ab82b66ba4d6ed3</frbrgroupid><rsrctype>book_chapters</rsrctype><prefilter>book_chapters</prefilter><language>eng</language><creationdate>2002</creationdate><topic>Algorithmics. Computability. Computer arithmetics</topic><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>DNA Matching</topic><topic>Exact sciences and technology</topic><topic>Search Trees</topic><topic>String Algorithms</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Iliopoulos, Costas S.</creatorcontrib><creatorcontrib>Makris, Christos</creatorcontrib><creatorcontrib>Sioutas, Spiros</creatorcontrib><creatorcontrib>Tsakalidis, Athanasios</creatorcontrib><creatorcontrib>Tsichlas, Kostas</creatorcontrib><collection>ProQuest Ebook Central - Book Chapters - Demo use only</collection><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Iliopoulos, Costas S.</au><au>Makris, Christos</au><au>Sioutas, Spiros</au><au>Tsakalidis, Athanasios</au><au>Tsichlas, Kostas</au><au>Apostolico, Alberto</au><au>Takeda, Masayuki</au><au>Apostolico, Alberto</au><au>Takeda, Masayuki</au><format>book</format><genre>bookitem</genre><ristype>CHAP</ristype><atitle>Identifying Occurrences of Maximal Pairs in Multiple Strings</atitle><btitle>Combinatorial Pattern Matching</btitle><seriestitle>Lecture Notes in Computer Science</seriestitle><date>2002-01-01</date><risdate>2002</risdate><volume>2373</volume><spage>133</spage><epage>143</epage><pages>133-143</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>3540438629</isbn><isbn>9783540438625</isbn><eisbn>9783540454526</eisbn><eisbn>3540454527</eisbn><abstract>A molecular sequence “model” is a (structured) sequence of distinct or identical strings separated by gaps; here we design and analyze efficient algorithms for variations of the “Model Matching” and “Model Identification” problems.</abstract><cop>Germany</cop><pub>Springer Berlin / Heidelberg</pub><doi>10.1007/3-540-45452-7_12</doi><oclcid>166466278</oclcid><tpages>11</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Combinatorial Pattern Matching, 2002, Vol.2373, p.133-143 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_14655239 |
| source | Springer Books |
| subjects | Algorithmics. Computability. Computer arithmetics Applied sciences Computer science control theory systems DNA Matching Exact sciences and technology Search Trees String Algorithms Theoretical computing |
| title | Identifying Occurrences of Maximal Pairs in Multiple Strings |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-02T06%3A17%3A29IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_pasca&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=bookitem&rft.atitle=Identifying%20Occurrences%20of%20Maximal%20Pairs%20in%20Multiple%20Strings&rft.btitle=Combinatorial%20Pattern%20Matching&rft.au=Iliopoulos,%20Costas%20S.&rft.date=2002-01-01&rft.volume=2373&rft.spage=133&rft.epage=143&rft.pages=133-143&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=3540438629&rft.isbn_list=9783540438625&rft_id=info:doi/10.1007/3-540-45452-7_12&rft_dat=%3Cproquest_pasca%3EEBC3071972_18_141%3C/proquest_pasca%3E%3Curl%3E%3C/url%3E&rft.eisbn=9783540454526&rft.eisbn_list=3540454527&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=EBC3071972_18_141&rft_id=info:pmid/&rfr_iscdi=true |