Flexible pattern matching in strings: practical on-line search algorithms for texts and biological sequences
String matching problems range from the relatively simple task of searching a single text for a string of characters to searching a database for approximate occurrences of a complex pattern. Recent years have witnessed a dramatic increase of interest in sophisticated string matching problems, especi...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Elektronisch E-Book |
Sprache: | English |
Veröffentlicht: |
Cambridge
Cambridge University Press
2002
|
Schlagworte: | |
Online-Zugang: | BSB01 FHN01 Volltext |
Zusammenfassung: | String matching problems range from the relatively simple task of searching a single text for a string of characters to searching a database for approximate occurrences of a complex pattern. Recent years have witnessed a dramatic increase of interest in sophisticated string matching problems, especially in information retrieval and computational biology. This book presents a practical approach to string matching problems, focusing on the algorithms and implementations that perform best in practice. It covers searching for simple, multiple and extended strings, as well as regular expressions, and exact and approximate searching. It includes all the most significant new developments in complex pattern searching. The clear explanations, step-by-step examples, algorithm pseudocode, and implementation efficiency maps will enable researchers, professionals and students in bioinformatics, computer science, and software engineering to choose the most appropriate algorithms for their applications |
Beschreibung: | Title from publisher's bibliographic system (viewed on 05 Oct 2015) |
Beschreibung: | 1 online resource (x, 221 pages) |
ISBN: | 9781316135228 |
DOI: | 10.1017/CBO9781316135228 |
Internformat
MARC
LEADER | 00000nmm a2200000zc 4500 | ||
---|---|---|---|
001 | BV043943597 | ||
003 | DE-604 | ||
005 | 20190322 | ||
007 | cr|uuu---uuuuu | ||
008 | 161206s2002 |||| o||u| ||||||eng d | ||
020 | |a 9781316135228 |c Online |9 978-1-316-13522-8 | ||
024 | 7 | |a 10.1017/CBO9781316135228 |2 doi | |
035 | |a (ZDB-20-CBO)CR9781316135228 | ||
035 | |a (OCoLC)967698461 | ||
035 | |a (DE-599)BVBBV043943597 | ||
040 | |a DE-604 |b ger |e rda | ||
041 | 0 | |a eng | |
049 | |a DE-12 |a DE-92 | ||
082 | 0 | |a 005.74 |2 21 | |
084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
084 | |a WC 7000 |0 (DE-625)148142: |2 rvk | ||
100 | 1 | |a Navarro, Gonzalo |d 1969- |e Verfasser |0 (DE-588)173649084 |4 aut | |
245 | 1 | 0 | |a Flexible pattern matching in strings |b practical on-line search algorithms for texts and biological sequences |c Gonzalo Navarro, Mathieu Raffinot |
264 | 1 | |a Cambridge |b Cambridge University Press |c 2002 | |
300 | |a 1 online resource (x, 221 pages) | ||
336 | |b txt |2 rdacontent | ||
337 | |b c |2 rdamedia | ||
338 | |b cr |2 rdacarrier | ||
500 | |a Title from publisher's bibliographic system (viewed on 05 Oct 2015) | ||
520 | |a String matching problems range from the relatively simple task of searching a single text for a string of characters to searching a database for approximate occurrences of a complex pattern. Recent years have witnessed a dramatic increase of interest in sophisticated string matching problems, especially in information retrieval and computational biology. This book presents a practical approach to string matching problems, focusing on the algorithms and implementations that perform best in practice. It covers searching for simple, multiple and extended strings, as well as regular expressions, and exact and approximate searching. It includes all the most significant new developments in complex pattern searching. The clear explanations, step-by-step examples, algorithm pseudocode, and implementation efficiency maps will enable researchers, professionals and students in bioinformatics, computer science, and software engineering to choose the most appropriate algorithms for their applications | ||
650 | 4 | |a Computer algorithms | |
650 | 4 | |a Database searching | |
650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Information Retrieval |0 (DE-588)4072803-1 |2 gnd |9 rswk-swf |
689 | 0 | 0 | |a Information Retrieval |0 (DE-588)4072803-1 |D s |
689 | 0 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
689 | 0 | |8 1\p |5 DE-604 | |
700 | 1 | |a Raffinot, Mathieu |d 1973- |e Sonstige |4 oth | |
776 | 0 | 8 | |i Erscheint auch als |n Druckausgabe |z 978-0-521-03993-2 |
776 | 0 | 8 | |i Erscheint auch als |n Druckausgabe |z 978-0-521-81307-5 |
856 | 4 | 0 | |u https://doi.org/10.1017/CBO9781316135228 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
912 | |a ZDB-20-CBO | ||
999 | |a oai:aleph.bib-bvb.de:BVB01-029352568 | ||
883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
966 | e | |u https://doi.org/10.1017/CBO9781316135228 |l BSB01 |p ZDB-20-CBO |q BSB_PDA_CBO |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1017/CBO9781316135228 |l FHN01 |p ZDB-20-CBO |q FHN_PDA_CBO |x Verlag |3 Volltext |
Datensatz im Suchindex
_version_ | 1804176887608508416 |
---|---|
any_adam_object | |
author | Navarro, Gonzalo 1969- |
author_GND | (DE-588)173649084 |
author_facet | Navarro, Gonzalo 1969- |
author_role | aut |
author_sort | Navarro, Gonzalo 1969- |
author_variant | g n gn |
building | Verbundindex |
bvnumber | BV043943597 |
classification_rvk | ST 130 ST 134 WC 7000 |
collection | ZDB-20-CBO |
ctrlnum | (ZDB-20-CBO)CR9781316135228 (OCoLC)967698461 (DE-599)BVBBV043943597 |
dewey-full | 005.74 |
dewey-hundreds | 000 - Computer science, information, general works |
dewey-ones | 005 - Computer programming, programs, data, security |
dewey-raw | 005.74 |
dewey-search | 005.74 |
dewey-sort | 15.74 |
dewey-tens | 000 - Computer science, information, general works |
discipline | Biologie Informatik |
doi_str_mv | 10.1017/CBO9781316135228 |
format | Electronic eBook |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03201nmm a2200529zc 4500</leader><controlfield tag="001">BV043943597</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20190322 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">161206s2002 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781316135228</subfield><subfield code="c">Online</subfield><subfield code="9">978-1-316-13522-8</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1017/CBO9781316135228</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-20-CBO)CR9781316135228</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)967698461</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043943597</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-92</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.74</subfield><subfield code="2">21</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 130</subfield><subfield code="0">(DE-625)143588:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 134</subfield><subfield code="0">(DE-625)143590:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">WC 7000</subfield><subfield code="0">(DE-625)148142:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Navarro, Gonzalo</subfield><subfield code="d">1969-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)173649084</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Flexible pattern matching in strings</subfield><subfield code="b">practical on-line search algorithms for texts and biological sequences</subfield><subfield code="c">Gonzalo Navarro, Mathieu Raffinot</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">2002</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (x, 221 pages)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Title from publisher's bibliographic system (viewed on 05 Oct 2015)</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">String matching problems range from the relatively simple task of searching a single text for a string of characters to searching a database for approximate occurrences of a complex pattern. Recent years have witnessed a dramatic increase of interest in sophisticated string matching problems, especially in information retrieval and computational biology. This book presents a practical approach to string matching problems, focusing on the algorithms and implementations that perform best in practice. It covers searching for simple, multiple and extended strings, as well as regular expressions, and exact and approximate searching. It includes all the most significant new developments in complex pattern searching. The clear explanations, step-by-step examples, algorithm pseudocode, and implementation efficiency maps will enable researchers, professionals and students in bioinformatics, computer science, and software engineering to choose the most appropriate algorithms for their applications</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Database searching</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Information Retrieval</subfield><subfield code="0">(DE-588)4072803-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Information Retrieval</subfield><subfield code="0">(DE-588)4072803-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Raffinot, Mathieu</subfield><subfield code="d">1973-</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druckausgabe</subfield><subfield code="z">978-0-521-03993-2</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druckausgabe</subfield><subfield code="z">978-0-521-81307-5</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1017/CBO9781316135228</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CBO</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-029352568</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9781316135228</subfield><subfield code="l">BSB01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">BSB_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9781316135228</subfield><subfield code="l">FHN01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">FHN_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
id | DE-604.BV043943597 |
illustrated | Not Illustrated |
indexdate | 2024-07-10T07:39:19Z |
institution | BVB |
isbn | 9781316135228 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-029352568 |
oclc_num | 967698461 |
open_access_boolean | |
owner | DE-12 DE-92 |
owner_facet | DE-12 DE-92 |
physical | 1 online resource (x, 221 pages) |
psigel | ZDB-20-CBO ZDB-20-CBO BSB_PDA_CBO ZDB-20-CBO FHN_PDA_CBO |
publishDate | 2002 |
publishDateSearch | 2002 |
publishDateSort | 2002 |
publisher | Cambridge University Press |
record_format | marc |
spelling | Navarro, Gonzalo 1969- Verfasser (DE-588)173649084 aut Flexible pattern matching in strings practical on-line search algorithms for texts and biological sequences Gonzalo Navarro, Mathieu Raffinot Cambridge Cambridge University Press 2002 1 online resource (x, 221 pages) txt rdacontent c rdamedia cr rdacarrier Title from publisher's bibliographic system (viewed on 05 Oct 2015) String matching problems range from the relatively simple task of searching a single text for a string of characters to searching a database for approximate occurrences of a complex pattern. Recent years have witnessed a dramatic increase of interest in sophisticated string matching problems, especially in information retrieval and computational biology. This book presents a practical approach to string matching problems, focusing on the algorithms and implementations that perform best in practice. It covers searching for simple, multiple and extended strings, as well as regular expressions, and exact and approximate searching. It includes all the most significant new developments in complex pattern searching. The clear explanations, step-by-step examples, algorithm pseudocode, and implementation efficiency maps will enable researchers, professionals and students in bioinformatics, computer science, and software engineering to choose the most appropriate algorithms for their applications Computer algorithms Database searching Algorithmus (DE-588)4001183-5 gnd rswk-swf Information Retrieval (DE-588)4072803-1 gnd rswk-swf Information Retrieval (DE-588)4072803-1 s Algorithmus (DE-588)4001183-5 s 1\p DE-604 Raffinot, Mathieu 1973- Sonstige oth Erscheint auch als Druckausgabe 978-0-521-03993-2 Erscheint auch als Druckausgabe 978-0-521-81307-5 https://doi.org/10.1017/CBO9781316135228 Verlag URL des Erstveröffentlichers Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
spellingShingle | Navarro, Gonzalo 1969- Flexible pattern matching in strings practical on-line search algorithms for texts and biological sequences Computer algorithms Database searching Algorithmus (DE-588)4001183-5 gnd Information Retrieval (DE-588)4072803-1 gnd |
subject_GND | (DE-588)4001183-5 (DE-588)4072803-1 |
title | Flexible pattern matching in strings practical on-line search algorithms for texts and biological sequences |
title_auth | Flexible pattern matching in strings practical on-line search algorithms for texts and biological sequences |
title_exact_search | Flexible pattern matching in strings practical on-line search algorithms for texts and biological sequences |
title_full | Flexible pattern matching in strings practical on-line search algorithms for texts and biological sequences Gonzalo Navarro, Mathieu Raffinot |
title_fullStr | Flexible pattern matching in strings practical on-line search algorithms for texts and biological sequences Gonzalo Navarro, Mathieu Raffinot |
title_full_unstemmed | Flexible pattern matching in strings practical on-line search algorithms for texts and biological sequences Gonzalo Navarro, Mathieu Raffinot |
title_short | Flexible pattern matching in strings |
title_sort | flexible pattern matching in strings practical on line search algorithms for texts and biological sequences |
title_sub | practical on-line search algorithms for texts and biological sequences |
topic | Computer algorithms Database searching Algorithmus (DE-588)4001183-5 gnd Information Retrieval (DE-588)4072803-1 gnd |
topic_facet | Computer algorithms Database searching Algorithmus Information Retrieval |
url | https://doi.org/10.1017/CBO9781316135228 |
work_keys_str_mv | AT navarrogonzalo flexiblepatternmatchinginstringspracticalonlinesearchalgorithmsfortextsandbiologicalsequences AT raffinotmathieu flexiblepatternmatchinginstringspracticalonlinesearchalgorithmsfortextsandbiologicalsequences |