|
|
|
Algorithmics
 Back
 | String Algorithmics
Costas Iliopoulos, Thierry Lecrot
In recent years there has been an unprecedented need for algorithms on strings. This is due to the increasing need for fast and innovative algorithms that can help researchers from other scientific areas conduct research more efficiently. Computational biology, computerized music analysis, and web searching are some of the research areas that constantly provide new problems on strings or require more efficient algorithms for known problems. In addition, many theoretical problems from Computer Science are closely related to well known problems on strings. This volume aims to provide some new methods and solutions for a subset of all these problems.
The organization of the book allows the reader to either obtain a broad overview or detailed knowledge of some of the main topics in string algorithmics. Each chapter of the book has been written by leading researchers in the fiield of string algorithmics. In a nutshell, the topics covered in this book are the following:
String Algorithms for Music Analysis
Algorithmic toolkits for Sequence Alignment
Search and extraction of regularities such as tandem repeats, motifs, etc.
The relationship between strings and the four-colour problem as well as the maximum common embedded subtree problem for ordered subtrees
Applications of string techniques to data compression
December 2004
ISBN 1-904987-02-8
Buy from Amazon: UK US
|
|
|
