A Four Russians algorithm for regular expression pattern matching
Journal of the ACM (JACM)
A new approach to text searching
Communications of the ACM
Fast text searching: allowing errors
Communications of the ACM
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
An efficient context-free parsing algorithm
Communications of the ACM
Programming Techniques: Regular expression search algorithm
Communications of the ACM
A guided tour to approximate string matching
ACM Computing Surveys (CSUR)
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Approximate matching of secondary structures
Proceedings of the sixth annual international conference on Computational biology
A Unified View to String Matching Algorithms
SOFSEM '96 Proceedings of the 23rd Seminar on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
| Hi-index | 0.00 |
Many RNA structures are assembled from a collection of RNA motifs, which appear repeatedly and in various combinations. Identification of RNA structural motifs will enhance our understanding of RNA structures and functions. Searching for secondary structural patterns in sequence databases is the basic technique and fundamental problem for extracting and identifying such motifs. A number of algorithms and programs have been developed for this purpose.In this paper, we adopt a representation of secondary structure called secondary expressions, and present two algorithms for finding all exact matches of a given secondary expression.