Algorithms on strings, trees, and sequences :: computer science and computational biology /
String algorithms are a traditional area of study in computer science. In recent years their importance has grown dramatically with the huge increase of electronically stored text and of molecular sequence data (DNA or protein sequences) produced by various genome projects. This 1997 book is a gener...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cambridge [England] ; New York :
Cambridge University Press,
1997.
|
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Zusammenfassung: | String algorithms are a traditional area of study in computer science. In recent years their importance has grown dramatically with the huge increase of electronically stored text and of molecular sequence data (DNA or protein sequences) produced by various genome projects. This 1997 book is a general text on computer algorithms for string processing. In addition to pure computer science, the book contains extensive discussions on biological problems that are cast as string problems, and on methods developed to solve them. It emphasises the fundamental ideas and techniques central to today's applications. New approaches to this complex material simplify methods that up to now have been for the specialist alone. With over 400 exercises to reinforce the material and develop additional topics, the book is suitable as a text for graduate or advanced undergraduate students in computer science, computational biology, or bio-informatics. Its discussion of current algorithms and techniques also makes it a reference for professionals. |
| Beschreibung: | 1 online resource (xviii, 534 pages) : illustrations |
| Bibliographie: | Includes bibliographical references (pages 505-523) and index. |
| ISBN: | 9781139811736 1139811738 9780511574931 0511574932 1107192145 9781107192140 1139811487 9781139811484 0511969651 9780511969652 1283870797 9781283870795 1139811606 9781139811606 |
Internformat
MARC
| LEADER | 00000cam a2200000 a 4500 | ||
|---|---|---|---|
| 001 | ZDB-4-EBA-ocn821611691 | ||
| 003 | OCoLC | ||
| 005 | 20241004212047.0 | ||
| 006 | m o d | ||
| 007 | cr cnu---unuuu | ||
| 008 | 121217s1997 enka ob 001 0 eng d | ||
| 040 | |a N$T |b eng |e pn |c N$T |d E7B |d CUS |d OCLCO |d OCLCF |d UMI |d DEBBG |d NLGGC |d DEBSZ |d YDXCP |d OCLCQ |d TOA |d AGLDB |d OCLCO |d OCLCA |d UAB |d OCLCQ |d VNS |d OCLCO |d OCLCQ |d VTS |d CEF |d REC |d OCLCA |d OCLCO |d WYU |d OCLCO |d OCLCA |d STF |d AU@ |d OCLCO |d OCLCQ |d OCLCA |d AJS |d OCLCQ |d OCLCO |d QGK |d OCLCO |d OCLCQ |d OCL |d OCLCO |d OCLCL |d SFB |d OCLCQ | ||
| 019 | |a 715168975 |a 871557291 |a 1065902891 |a 1109003051 |a 1259061337 | ||
| 020 | |a 9781139811736 |q (electronic bk.) | ||
| 020 | |a 1139811738 |q (electronic bk.) | ||
| 020 | |a 9780511574931 |q (e-book) | ||
| 020 | |a 0511574932 |q (e-book) | ||
| 020 | |z 0521585198 | ||
| 020 | |z 9780521585194 | ||
| 020 | |a 1107192145 | ||
| 020 | |a 9781107192140 | ||
| 020 | |a 1139811487 | ||
| 020 | |a 9781139811484 | ||
| 020 | |a 0511969651 | ||
| 020 | |a 9780511969652 | ||
| 020 | |a 1283870797 | ||
| 020 | |a 9781283870795 | ||
| 020 | |a 1139811606 | ||
| 020 | |a 9781139811606 | ||
| 035 | |a (OCoLC)821611691 |z (OCoLC)715168975 |z (OCoLC)871557291 |z (OCoLC)1065902891 |z (OCoLC)1109003051 |z (OCoLC)1259061337 | ||
| 037 | |a CL0500000394 |b Safari Books Online | ||
| 050 | 4 | |a QA76.9.A43 |b G87 1997eb | |
| 060 | 4 | |a 1997 I-920 | |
| 060 | 4 | |a QA 76.9.A43 |b G982a 1997 | |
| 072 | 7 | |a COM |x 018000 |2 bisacsh | |
| 082 | 7 | |a 005.7/3 |2 22 | |
| 084 | |a 42.10 |2 bcl | ||
| 084 | |a 54.10 |2 bcl | ||
| 084 | |a ST 360 |2 rvk | ||
| 084 | |a ST 630 |2 rvk | ||
| 084 | |a WC 7000 |2 rvk | ||
| 084 | |a WC 7700 |2 rvk | ||
| 084 | |a BIO 110f |2 stub | ||
| 084 | |a DAT 537f |2 stub | ||
| 049 | |a MAIN | ||
| 100 | 1 | |a Gusfield, Dan. | |
| 245 | 1 | 0 | |a Algorithms on strings, trees, and sequences : |b computer science and computational biology / |c Dan Gusfield. |
| 260 | |a Cambridge [England] ; |a New York : |b Cambridge University Press, |c 1997. | ||
| 300 | |a 1 online resource (xviii, 534 pages) : |b illustrations | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 504 | |a Includes bibliographical references (pages 505-523) and index. | ||
| 505 | 0 | |a Exact matching: fundamental preprocessing and first algorithms -- Exact matching: classical comparison-based methods -- Exact matching: a deeper look at classical methods -- Seminumerical string matching -- Introduction to suffix trees -- Linear-time construction of suffix trees -- First applications of suffix trees -- Constant-time lowest common ancestor retrieval -- More applications of suffix trees -- The importance of (sub)sequence comparison in molecular biology --Core string edits, alignments, and dynamic programming -- Refining core string edits and alignments -- Extending the core problems -- Multiple string comparison -- The Holy Grail -- sequence databases and their uses- The Mother Lode -- Maps, mapping, sequencing, and superstrings -- Strings and evolutionary trees -- Three short topics -- Models of Genome-level mutations. | |
| 588 | 0 | |a Print version record. | |
| 520 | |a String algorithms are a traditional area of study in computer science. In recent years their importance has grown dramatically with the huge increase of electronically stored text and of molecular sequence data (DNA or protein sequences) produced by various genome projects. This 1997 book is a general text on computer algorithms for string processing. In addition to pure computer science, the book contains extensive discussions on biological problems that are cast as string problems, and on methods developed to solve them. It emphasises the fundamental ideas and techniques central to today's applications. New approaches to this complex material simplify methods that up to now have been for the specialist alone. With over 400 exercises to reinforce the material and develop additional topics, the book is suitable as a text for graduate or advanced undergraduate students in computer science, computational biology, or bio-informatics. Its discussion of current algorithms and techniques also makes it a reference for professionals. | ||
| 546 | |a English. | ||
| 650 | 0 | |a Computer algorithms. |0 http://id.loc.gov/authorities/subjects/sh91000149 | |
| 650 | 0 | |a Computational biology. |0 http://id.loc.gov/authorities/subjects/sh2003008355 | |
| 650 | 0 | |a Molecular biology |x Data processing. | |
| 650 | 0 | |a Algorithms. |0 http://id.loc.gov/authorities/subjects/sh85003487 | |
| 650 | 0 | |a Bioinformatics. |0 http://id.loc.gov/authorities/subjects/sh00003585 | |
| 650 | 0 | |a Electronic data processing. |0 http://id.loc.gov/authorities/subjects/sh85042288 | |
| 650 | 0 | |a Computer science. |0 http://id.loc.gov/authorities/subjects/sh89003285 | |
| 650 | 2 | |a Algorithms | |
| 650 | 2 | |a Sequence Analysis | |
| 650 | 2 | |a Molecular Biology | |
| 650 | 2 | |a Electronic Data Processing | |
| 650 | 2 | |a Computational Biology |0 https://id.nlm.nih.gov/mesh/D019295 | |
| 650 | 6 | |a Algorithmes. | |
| 650 | 6 | |a Biologie moléculaire |x Informatique. | |
| 650 | 6 | |a Bio-informatique. | |
| 650 | 6 | |a Informatique. | |
| 650 | 7 | |a algorithms. |2 aat | |
| 650 | 7 | |a computer science. |2 aat | |
| 650 | 7 | |a data processing. |2 aat | |
| 650 | 7 | |a COMPUTERS |x Data Processing. |2 bisacsh | |
| 650 | 7 | |a Electronic data processing |2 fast | |
| 650 | 7 | |a Computer science |2 fast | |
| 650 | 7 | |a Bioinformatics |2 fast | |
| 650 | 7 | |a Algorithms |2 fast | |
| 650 | 7 | |a Computational biology |2 fast | |
| 650 | 7 | |a Computer algorithms |2 fast | |
| 650 | 7 | |a Molecular biology |x Data processing |2 fast | |
| 650 | 7 | |a Algorithmus |2 gnd |0 http://d-nb.info/gnd/4001183-5 | |
| 650 | 7 | |a Biologie |2 gnd | |
| 650 | 7 | |a Molekularbiologie |2 gnd | |
| 650 | 7 | |a Zeichenkette |2 gnd |0 http://d-nb.info/gnd/4067448-4 | |
| 650 | 1 | 7 | |a Bio-informatica. |2 gtt |
| 650 | 1 | 7 | |a Moleculaire biologie. |2 gtt |
| 650 | 1 | 7 | |a Algoritmen. |2 gtt |
| 650 | 1 | 7 | |a Matching. |2 gtt |
| 650 | 7 | |a Algorithmes. |2 ram | |
| 650 | 7 | |a Biologie moléculaire |x Informatique. |2 ram | |
| 758 | |i has work: |a Algorithms on strings, trees, and sequences (Text) |1 https://id.oclc.org/worldcat/entity/E39PCFYwG6MVpctFJyhtFBJ8fm |4 https://id.oclc.org/worldcat/ontology/hasWork | ||
| 776 | 0 | 8 | |i Print version: |a Gusfield, Dan. |t Algorithms on strings, trees, and sequences. |d Cambridge [England] ; New York : Cambridge University Press, 1997 |z 0521585198 |w (DLC) 96046612 |w (OCoLC)35688227 |
| 856 | 4 | 0 | |l FWS01 |p ZDB-4-EBA |q FWS_PDA_EBA |u https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=502387 |3 Volltext |
| 938 | |a ebrary |b EBRY |n ebr10452049 | ||
| 938 | |a EBSCOhost |b EBSC |n 502387 | ||
| 938 | |a YBP Library Services |b YANK |n 9958670 | ||
| 994 | |a 92 |b GEBAY | ||
| 912 | |a ZDB-4-EBA | ||
| 049 | |a DE-863 | ||
Datensatz im Suchindex
| DE-BY-FWS_katkey | ZDB-4-EBA-ocn821611691 |
|---|---|
| _version_ | 1816882216752381952 |
| adam_text | |
| any_adam_object | |
| author | Gusfield, Dan |
| author_facet | Gusfield, Dan |
| author_role | |
| author_sort | Gusfield, Dan |
| author_variant | d g dg |
| building | Verbundindex |
| bvnumber | localFWS |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.9.A43 G87 1997eb |
| callnumber-search | QA76.9.A43 G87 1997eb |
| callnumber-sort | QA 276.9 A43 G87 41997EB |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 360 ST 630 WC 7000 WC 7700 |
| classification_tum | BIO 110f DAT 537f |
| collection | ZDB-4-EBA |
| contents | Exact matching: fundamental preprocessing and first algorithms -- Exact matching: classical comparison-based methods -- Exact matching: a deeper look at classical methods -- Seminumerical string matching -- Introduction to suffix trees -- Linear-time construction of suffix trees -- First applications of suffix trees -- Constant-time lowest common ancestor retrieval -- More applications of suffix trees -- The importance of (sub)sequence comparison in molecular biology --Core string edits, alignments, and dynamic programming -- Refining core string edits and alignments -- Extending the core problems -- Multiple string comparison -- The Holy Grail -- sequence databases and their uses- The Mother Lode -- Maps, mapping, sequencing, and superstrings -- Strings and evolutionary trees -- Three short topics -- Models of Genome-level mutations. |
| ctrlnum | (OCoLC)821611691 |
| dewey-full | 005.7/3 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.7/3 |
| dewey-search | 005.7/3 |
| dewey-sort | 15.7 13 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Biologie Informatik |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>06682cam a2201177 a 4500</leader><controlfield tag="001">ZDB-4-EBA-ocn821611691</controlfield><controlfield tag="003">OCoLC</controlfield><controlfield tag="005">20241004212047.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr cnu---unuuu</controlfield><controlfield tag="008">121217s1997 enka ob 001 0 eng d</controlfield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">N$T</subfield><subfield code="b">eng</subfield><subfield code="e">pn</subfield><subfield code="c">N$T</subfield><subfield code="d">E7B</subfield><subfield code="d">CUS</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCF</subfield><subfield code="d">UMI</subfield><subfield code="d">DEBBG</subfield><subfield code="d">NLGGC</subfield><subfield code="d">DEBSZ</subfield><subfield code="d">YDXCP</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">TOA</subfield><subfield code="d">AGLDB</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCA</subfield><subfield code="d">UAB</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">VNS</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">VTS</subfield><subfield code="d">CEF</subfield><subfield code="d">REC</subfield><subfield code="d">OCLCA</subfield><subfield code="d">OCLCO</subfield><subfield code="d">WYU</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCA</subfield><subfield code="d">STF</subfield><subfield code="d">AU@</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCA</subfield><subfield code="d">AJS</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">QGK</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCL</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCL</subfield><subfield code="d">SFB</subfield><subfield code="d">OCLCQ</subfield></datafield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">715168975</subfield><subfield code="a">871557291</subfield><subfield code="a">1065902891</subfield><subfield code="a">1109003051</subfield><subfield code="a">1259061337</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781139811736</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1139811738</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511574931</subfield><subfield code="q">(e-book)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0511574932</subfield><subfield code="q">(e-book)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">0521585198</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9780521585194</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1107192145</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781107192140</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1139811487</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781139811484</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0511969651</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511969652</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1283870797</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781283870795</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1139811606</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781139811606</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)821611691</subfield><subfield code="z">(OCoLC)715168975</subfield><subfield code="z">(OCoLC)871557291</subfield><subfield code="z">(OCoLC)1065902891</subfield><subfield code="z">(OCoLC)1109003051</subfield><subfield code="z">(OCoLC)1259061337</subfield></datafield><datafield tag="037" ind1=" " ind2=" "><subfield code="a">CL0500000394</subfield><subfield code="b">Safari Books Online</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA76.9.A43</subfield><subfield code="b">G87 1997eb</subfield></datafield><datafield tag="060" ind1=" " ind2="4"><subfield code="a">1997 I-920</subfield></datafield><datafield tag="060" ind1=" " ind2="4"><subfield code="a">QA 76.9.A43</subfield><subfield code="b">G982a 1997</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM</subfield><subfield code="x">018000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="082" ind1="7" ind2=" "><subfield code="a">005.7/3</subfield><subfield code="2">22</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">42.10</subfield><subfield code="2">bcl</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">54.10</subfield><subfield code="2">bcl</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 360</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 630</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">WC 7000</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">WC 7700</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">BIO 110f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 537f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">MAIN</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Gusfield, Dan.</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithms on strings, trees, and sequences :</subfield><subfield code="b">computer science and computational biology /</subfield><subfield code="c">Dan Gusfield.</subfield></datafield><datafield tag="260" ind1=" " ind2=" "><subfield code="a">Cambridge [England] ;</subfield><subfield code="a">New York :</subfield><subfield code="b">Cambridge University Press,</subfield><subfield code="c">1997.</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (xviii, 534 pages) :</subfield><subfield code="b">illustrations</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references (pages 505-523) and index.</subfield></datafield><datafield tag="505" ind1="0" ind2=" "><subfield code="a">Exact matching: fundamental preprocessing and first algorithms -- Exact matching: classical comparison-based methods -- Exact matching: a deeper look at classical methods -- Seminumerical string matching -- Introduction to suffix trees -- Linear-time construction of suffix trees -- First applications of suffix trees -- Constant-time lowest common ancestor retrieval -- More applications of suffix trees -- The importance of (sub)sequence comparison in molecular biology --Core string edits, alignments, and dynamic programming -- Refining core string edits and alignments -- Extending the core problems -- Multiple string comparison -- The Holy Grail -- sequence databases and their uses- The Mother Lode -- Maps, mapping, sequencing, and superstrings -- Strings and evolutionary trees -- Three short topics -- Models of Genome-level mutations.</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Print version record.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">String algorithms are a traditional area of study in computer science. In recent years their importance has grown dramatically with the huge increase of electronically stored text and of molecular sequence data (DNA or protein sequences) produced by various genome projects. This 1997 book is a general text on computer algorithms for string processing. In addition to pure computer science, the book contains extensive discussions on biological problems that are cast as string problems, and on methods developed to solve them. It emphasises the fundamental ideas and techniques central to today's applications. New approaches to this complex material simplify methods that up to now have been for the specialist alone. With over 400 exercises to reinforce the material and develop additional topics, the book is suitable as a text for graduate or advanced undergraduate students in computer science, computational biology, or bio-informatics. Its discussion of current algorithms and techniques also makes it a reference for professionals.</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">English.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Computer algorithms.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh91000149</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Computational biology.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh2003008355</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Molecular biology</subfield><subfield code="x">Data processing.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Algorithms.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85003487</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Bioinformatics.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh00003585</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Electronic data processing.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85042288</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Computer science.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh89003285</subfield></datafield><datafield tag="650" ind1=" " ind2="2"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="2"><subfield code="a">Sequence Analysis</subfield></datafield><datafield tag="650" ind1=" " ind2="2"><subfield code="a">Molecular Biology</subfield></datafield><datafield tag="650" ind1=" " ind2="2"><subfield code="a">Electronic Data Processing</subfield></datafield><datafield tag="650" ind1=" " ind2="2"><subfield code="a">Computational Biology</subfield><subfield code="0">https://id.nlm.nih.gov/mesh/D019295</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Algorithmes.</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Biologie moléculaire</subfield><subfield code="x">Informatique.</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Bio-informatique.</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Informatique.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">algorithms.</subfield><subfield code="2">aat</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">computer science.</subfield><subfield code="2">aat</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">data processing.</subfield><subfield code="2">aat</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS</subfield><subfield code="x">Data Processing.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Electronic data processing</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer science</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Bioinformatics</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algorithms</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computational biology</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer algorithms</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Molecular biology</subfield><subfield code="x">Data processing</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="2">gnd</subfield><subfield code="0">http://d-nb.info/gnd/4001183-5</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Biologie</subfield><subfield code="2">gnd</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Molekularbiologie</subfield><subfield code="2">gnd</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Zeichenkette</subfield><subfield code="2">gnd</subfield><subfield code="0">http://d-nb.info/gnd/4067448-4</subfield></datafield><datafield tag="650" ind1="1" ind2="7"><subfield code="a">Bio-informatica.</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1="1" ind2="7"><subfield code="a">Moleculaire biologie.</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1="1" ind2="7"><subfield code="a">Algoritmen.</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1="1" ind2="7"><subfield code="a">Matching.</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algorithmes.</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Biologie moléculaire</subfield><subfield code="x">Informatique.</subfield><subfield code="2">ram</subfield></datafield><datafield tag="758" ind1=" " ind2=" "><subfield code="i">has work:</subfield><subfield code="a">Algorithms on strings, trees, and sequences (Text)</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PCFYwG6MVpctFJyhtFBJ8fm</subfield><subfield code="4">https://id.oclc.org/worldcat/ontology/hasWork</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Print version:</subfield><subfield code="a">Gusfield, Dan.</subfield><subfield code="t">Algorithms on strings, trees, and sequences.</subfield><subfield code="d">Cambridge [England] ; New York : Cambridge University Press, 1997</subfield><subfield code="z">0521585198</subfield><subfield code="w">(DLC) 96046612</subfield><subfield code="w">(OCoLC)35688227</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="l">FWS01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FWS_PDA_EBA</subfield><subfield code="u">https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=502387</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ebrary</subfield><subfield code="b">EBRY</subfield><subfield code="n">ebr10452049</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBSCOhost</subfield><subfield code="b">EBSC</subfield><subfield code="n">502387</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">9958670</subfield></datafield><datafield tag="994" ind1=" " ind2=" "><subfield code="a">92</subfield><subfield code="b">GEBAY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-EBA</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-863</subfield></datafield></record></collection> |
| id | ZDB-4-EBA-ocn821611691 |
| illustrated | Illustrated |
| indexdate | 2024-11-27T13:25:05Z |
| institution | BVB |
| isbn | 9781139811736 1139811738 9780511574931 0511574932 1107192145 9781107192140 1139811487 9781139811484 0511969651 9780511969652 1283870797 9781283870795 1139811606 9781139811606 |
| language | English |
| oclc_num | 821611691 |
| open_access_boolean | |
| owner | MAIN DE-863 DE-BY-FWS |
| owner_facet | MAIN DE-863 DE-BY-FWS |
| physical | 1 online resource (xviii, 534 pages) : illustrations |
| psigel | ZDB-4-EBA |
| publishDate | 1997 |
| publishDateSearch | 1997 |
| publishDateSort | 1997 |
| publisher | Cambridge University Press, |
| record_format | marc |
| spelling | Gusfield, Dan. Algorithms on strings, trees, and sequences : computer science and computational biology / Dan Gusfield. Cambridge [England] ; New York : Cambridge University Press, 1997. 1 online resource (xviii, 534 pages) : illustrations text txt rdacontent computer c rdamedia online resource cr rdacarrier Includes bibliographical references (pages 505-523) and index. Exact matching: fundamental preprocessing and first algorithms -- Exact matching: classical comparison-based methods -- Exact matching: a deeper look at classical methods -- Seminumerical string matching -- Introduction to suffix trees -- Linear-time construction of suffix trees -- First applications of suffix trees -- Constant-time lowest common ancestor retrieval -- More applications of suffix trees -- The importance of (sub)sequence comparison in molecular biology --Core string edits, alignments, and dynamic programming -- Refining core string edits and alignments -- Extending the core problems -- Multiple string comparison -- The Holy Grail -- sequence databases and their uses- The Mother Lode -- Maps, mapping, sequencing, and superstrings -- Strings and evolutionary trees -- Three short topics -- Models of Genome-level mutations. Print version record. String algorithms are a traditional area of study in computer science. In recent years their importance has grown dramatically with the huge increase of electronically stored text and of molecular sequence data (DNA or protein sequences) produced by various genome projects. This 1997 book is a general text on computer algorithms for string processing. In addition to pure computer science, the book contains extensive discussions on biological problems that are cast as string problems, and on methods developed to solve them. It emphasises the fundamental ideas and techniques central to today's applications. New approaches to this complex material simplify methods that up to now have been for the specialist alone. With over 400 exercises to reinforce the material and develop additional topics, the book is suitable as a text for graduate or advanced undergraduate students in computer science, computational biology, or bio-informatics. Its discussion of current algorithms and techniques also makes it a reference for professionals. English. Computer algorithms. http://id.loc.gov/authorities/subjects/sh91000149 Computational biology. http://id.loc.gov/authorities/subjects/sh2003008355 Molecular biology Data processing. Algorithms. http://id.loc.gov/authorities/subjects/sh85003487 Bioinformatics. http://id.loc.gov/authorities/subjects/sh00003585 Electronic data processing. http://id.loc.gov/authorities/subjects/sh85042288 Computer science. http://id.loc.gov/authorities/subjects/sh89003285 Algorithms Sequence Analysis Molecular Biology Electronic Data Processing Computational Biology https://id.nlm.nih.gov/mesh/D019295 Algorithmes. Biologie moléculaire Informatique. Bio-informatique. Informatique. algorithms. aat computer science. aat data processing. aat COMPUTERS Data Processing. bisacsh Electronic data processing fast Computer science fast Bioinformatics fast Algorithms fast Computational biology fast Computer algorithms fast Molecular biology Data processing fast Algorithmus gnd http://d-nb.info/gnd/4001183-5 Biologie gnd Molekularbiologie gnd Zeichenkette gnd http://d-nb.info/gnd/4067448-4 Bio-informatica. gtt Moleculaire biologie. gtt Algoritmen. gtt Matching. gtt Algorithmes. ram Biologie moléculaire Informatique. ram has work: Algorithms on strings, trees, and sequences (Text) https://id.oclc.org/worldcat/entity/E39PCFYwG6MVpctFJyhtFBJ8fm https://id.oclc.org/worldcat/ontology/hasWork Print version: Gusfield, Dan. Algorithms on strings, trees, and sequences. Cambridge [England] ; New York : Cambridge University Press, 1997 0521585198 (DLC) 96046612 (OCoLC)35688227 FWS01 ZDB-4-EBA FWS_PDA_EBA https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=502387 Volltext |
| spellingShingle | Gusfield, Dan Algorithms on strings, trees, and sequences : computer science and computational biology / Exact matching: fundamental preprocessing and first algorithms -- Exact matching: classical comparison-based methods -- Exact matching: a deeper look at classical methods -- Seminumerical string matching -- Introduction to suffix trees -- Linear-time construction of suffix trees -- First applications of suffix trees -- Constant-time lowest common ancestor retrieval -- More applications of suffix trees -- The importance of (sub)sequence comparison in molecular biology --Core string edits, alignments, and dynamic programming -- Refining core string edits and alignments -- Extending the core problems -- Multiple string comparison -- The Holy Grail -- sequence databases and their uses- The Mother Lode -- Maps, mapping, sequencing, and superstrings -- Strings and evolutionary trees -- Three short topics -- Models of Genome-level mutations. Computer algorithms. http://id.loc.gov/authorities/subjects/sh91000149 Computational biology. http://id.loc.gov/authorities/subjects/sh2003008355 Molecular biology Data processing. Algorithms. http://id.loc.gov/authorities/subjects/sh85003487 Bioinformatics. http://id.loc.gov/authorities/subjects/sh00003585 Electronic data processing. http://id.loc.gov/authorities/subjects/sh85042288 Computer science. http://id.loc.gov/authorities/subjects/sh89003285 Algorithms Sequence Analysis Molecular Biology Electronic Data Processing Computational Biology https://id.nlm.nih.gov/mesh/D019295 Algorithmes. Biologie moléculaire Informatique. Bio-informatique. Informatique. algorithms. aat computer science. aat data processing. aat COMPUTERS Data Processing. bisacsh Electronic data processing fast Computer science fast Bioinformatics fast Algorithms fast Computational biology fast Computer algorithms fast Molecular biology Data processing fast Algorithmus gnd http://d-nb.info/gnd/4001183-5 Biologie gnd Molekularbiologie gnd Zeichenkette gnd http://d-nb.info/gnd/4067448-4 Bio-informatica. gtt Moleculaire biologie. gtt Algoritmen. gtt Matching. gtt Algorithmes. ram Biologie moléculaire Informatique. ram |
| subject_GND | http://id.loc.gov/authorities/subjects/sh91000149 http://id.loc.gov/authorities/subjects/sh2003008355 http://id.loc.gov/authorities/subjects/sh85003487 http://id.loc.gov/authorities/subjects/sh00003585 http://id.loc.gov/authorities/subjects/sh85042288 http://id.loc.gov/authorities/subjects/sh89003285 https://id.nlm.nih.gov/mesh/D019295 http://d-nb.info/gnd/4001183-5 http://d-nb.info/gnd/4067448-4 |
| title | Algorithms on strings, trees, and sequences : computer science and computational biology / |
| title_auth | Algorithms on strings, trees, and sequences : computer science and computational biology / |
| title_exact_search | Algorithms on strings, trees, and sequences : computer science and computational biology / |
| title_full | Algorithms on strings, trees, and sequences : computer science and computational biology / Dan Gusfield. |
| title_fullStr | Algorithms on strings, trees, and sequences : computer science and computational biology / Dan Gusfield. |
| title_full_unstemmed | Algorithms on strings, trees, and sequences : computer science and computational biology / Dan Gusfield. |
| title_short | Algorithms on strings, trees, and sequences : |
| title_sort | algorithms on strings trees and sequences computer science and computational biology |
| title_sub | computer science and computational biology / |
| topic | Computer algorithms. http://id.loc.gov/authorities/subjects/sh91000149 Computational biology. http://id.loc.gov/authorities/subjects/sh2003008355 Molecular biology Data processing. Algorithms. http://id.loc.gov/authorities/subjects/sh85003487 Bioinformatics. http://id.loc.gov/authorities/subjects/sh00003585 Electronic data processing. http://id.loc.gov/authorities/subjects/sh85042288 Computer science. http://id.loc.gov/authorities/subjects/sh89003285 Algorithms Sequence Analysis Molecular Biology Electronic Data Processing Computational Biology https://id.nlm.nih.gov/mesh/D019295 Algorithmes. Biologie moléculaire Informatique. Bio-informatique. Informatique. algorithms. aat computer science. aat data processing. aat COMPUTERS Data Processing. bisacsh Electronic data processing fast Computer science fast Bioinformatics fast Algorithms fast Computational biology fast Computer algorithms fast Molecular biology Data processing fast Algorithmus gnd http://d-nb.info/gnd/4001183-5 Biologie gnd Molekularbiologie gnd Zeichenkette gnd http://d-nb.info/gnd/4067448-4 Bio-informatica. gtt Moleculaire biologie. gtt Algoritmen. gtt Matching. gtt Algorithmes. ram Biologie moléculaire Informatique. ram |
| topic_facet | Computer algorithms. Computational biology. Molecular biology Data processing. Algorithms. Bioinformatics. Electronic data processing. Computer science. Algorithms Sequence Analysis Molecular Biology Electronic Data Processing Computational Biology Algorithmes. Biologie moléculaire Informatique. Bio-informatique. Informatique. algorithms. computer science. data processing. COMPUTERS Data Processing. Electronic data processing Computer science Bioinformatics Computational biology Computer algorithms Molecular biology Data processing Algorithmus Biologie Molekularbiologie Zeichenkette Bio-informatica. Moleculaire biologie. Algoritmen. Matching. |
| url | https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=502387 |
| work_keys_str_mv | AT gusfielddan algorithmsonstringstreesandsequencescomputerscienceandcomputationalbiology |