Cargando…
Algorithms on strings, trees, and sequences : computer science and computational biology
Publisher Description (unedited publisher data) 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 va...
| Autor principal: | |
|---|---|
| Formato: | Libro |
| Lenguaje: | English |
| Publicado: |
Cambridge [England] ; New York :
Cambridge University Press,
1997
|
| Edición: | First published |
| Materias: |
MARC
| LEADER | 00000cam a2200000 a 4500 | ||
|---|---|---|---|
| 001 | ocm35688227 | ||
| 003 | UV# | ||
| 005 | 20150226115540.0 | ||
| 008 | 150226s1997 -USa b 001 0 eng | ||
| 010 | |a 96046612 | ||
| 015 | |2 bnb | ||
| 020 | |a 0521585198 | ||
| 020 | |a 9780521585194 | ||
| 040 | |a DLC |b eng |c DLC |d UV# | ||
| 050 | 4 | |a QA76.6 |b G83 1997 | |
| 082 | 0 | 0 | |a 005.7/3 |2 21 |
| 100 | 1 | |a Gusfield, Dan |9 413747 | |
| 245 | 1 | 0 | |a Algorithms on strings, trees, and sequences : |b computer science and computational biology |c / Dan Gusfield. |
| 250 | |a First published | ||
| 260 | |a Cambridge [England] ; |a New York : |b Cambridge University Press, |c 1997 | ||
| 300 | |a xviii, 534 páginas : |b ilustraciones ; |c 26 cm | ||
| 500 | |a Glosario: páginas 524-529. | ||
| 504 | |a Bibliografía: páginas 505-523 e índice. | ||
| 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. | |
| 520 | |a Publisher Description (unedited publisher data) 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 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. Library of Congress subject headings for this publication: Computer algorithms, Bioinformatics, Molecular biology Data processing. | ||
| 650 | 4 | |a Algoritmos en informática |9 357343 | |
| 942 | |c LIBRO |6 _ | ||
| 948 | |h NO HOLDINGS IN UV# - 491 OTHER HOLDINGS | ||
| 999 | |c 288340 |d 288340 | ||