Review of combinatorial pattern matching algorithms in computational biology using Perl and R, by Gabriel Valiente

References
[1]
Dan Gusfield. Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology. Cambridge University Press, 1997.
[2]
Daniel H. Huson, Regula Rupp, and Celine Scornavacca. Phylogenetic Networks: Concepts, Algorithms and Applications. Cambridge University Press, 2011. http://www.phylogeneticnetworks.org/.
[3]
Gabriel Valiente. Algorithms on Trees and Graphs. Springer, 2002.
Index Terms
- Review of combinatorial pattern matching algorithms in computational biology using Perl and R, by Gabriel Valiente
Recommendations
Exact online two-dimensional pattern matching using multiple pattern matching algorithms
Baker and Bird and Baeza-Yates and Regnier are two of the most efficient and widely used algorithms for exact online two-dimensional pattern matching. Both use the automaton of the Aho-Corasick multiple pattern matching algorithm to locate all the ...
Comments
Information & Contributors
Information
Published In

Copyright © 2012 Author.
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 27 August 2012
Published in SIGACT Volume 43, Issue 3
Check for updates
Qualifiers
- Review-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 68Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 16 Feb 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in