A fast string searching algorithm
Communications of the ACM
Probabilistic Ancestral Sequences and Multiple Alignments
SWAT '96 Proceedings of the 5th Scandinavian Workshop on Algorithm Theory
String Searching Algorithms Revisited
WADS '89 Proceedings of the Workshop on Algorithms and Data Structures
Fast profile matching algorithms – A survey
Theoretical Computer Science
| Hi-index | 0.00 |
Bioinformatics, the discipline which studies the computational problems arising from molecular biology, poses many interesting problems to the string searching community. We will describe two problems arising from Bioinformatics, their preliminary solutions, and the more general problem that they pose. The first problem is searching for α-helices in protein sequences. This particular instance of the search is based on matching of hydrophobicity/hydrophilicity. We find an algorithm which is linear in the sequence length for fixed helix length and is O(n log n) for any helix length. The second problem is on matching probabilistic sequences against sequences or against other probabilistic sequences. In both cases we derive efficient formulas to compute scores according to a Markovian model of evolution.