Algorithms on Strings, Trees, and Sequences: Computer Science and Computational BiologyCambridge University Press, 1997 M05 28 - 534 páginas 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. |
Contenido
II Suffix Trees and Their Uses | 87 |
III Inexact Matching Sequence Alignment Dynamic Programming | 209 |
IV Currents Cousins and Cameos | 393 |
Epilogue where next? | 501 |
Bibliography | 505 |
Glossary | 524 |
530 | |
Otras ediciones - Ver todas
Algorithms on Strings, Trees and Sequences: Computer Science and ... Dan Gusfield Vista previa limitada - 1997 |
Términos y frases comunes
additional algorithm allow amino acid analysis applications approach assume begin biology block bound called cell character clone column common compared comparisons compute consider construct contains copy created database defined Definition denote detail determine discussed dynamic programming edge edit distance equal error exact exactly example exercise extension fact Figure find first function gene given gives graph Hence idea important increasing interval known labeled leaf leaves Lemma length linear longest mapping matching matrix maximal method mismatch molecular multiple alignment needed node obtained occurs optimal pair path pattem pattern phase position possible prefix preprocessing problem proof protein repeats represented result root rule score sequence shift similarity single solution solve space specific starting string structure subsequence substring suffix tree Theorem weight