Buch, Englisch, 392 Seiten, Format (B × H): 152 mm x 229 mm, Gewicht: 566 g
Buch, Englisch, 392 Seiten, Format (B × H): 152 mm x 229 mm, Gewicht: 566 g
ISBN: 978-1-107-67099-0
Verlag: Cambridge University Press
The book is intended for lectures on string processes and pattern matching in Master's courses of computer science and software engineering curricula. The details of algorithms are given with correctness proofs and complexity analysis, which make them ready to implement. Algorithms are described in a C-like language. The book is also a reference for students in computational linguistics or computational biology. It presents examples of questions related to the automatic processing of natural language, to the analysis of molecular sequences, and to the management of textual databases.
Autoren/Hrsg.
Fachgebiete
- Mathematik | Informatik Mathematik Mathematik Allgemein Diskrete Mathematik, Kombinatorik
- Technische Wissenschaften Verfahrenstechnik | Chemieingenieurwesen | Biotechnologie Biotechnologie
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Algorithmen & Datenstrukturen
- Naturwissenschaften Biowissenschaften Biowissenschaften
Weitere Infos & Material
1. Tools; 2. Pattern matching automata; 3. String searching with a sliding window; 4. Suffix arrays; 5. Structures for indexes; 6. Indexes; 7. Alignments; 8. Approximate patterns; 9. Local periods.