Content deleted Content added
→Single pattern algorithms: boyer moore strictly has a runtime of O(nm), could be looked up if clicking on the link |
→External links: removed dead link, added link to multi string implementations |
||
Line 105:
* [http://www.cs.ucr.edu/%7Estelo/pattern.html Huge (maintained) list of pattern matching links] Last updated:12/27/2008 20:18:38
* [http://johannburkard.de/software/stringsearch/ StringSearch – high-performance pattern matching algorithms in Java] – Implementations of many String-Matching-Algorithms in Java (BNDM, Boyer-Moore-Horspool, Boyer-Moore-Horspool-Raita, Shift-Or)
* [http://stringsandchars.amygdalum.net/ StringsAndChars] – Implementations of many String-Matching-Algorithms (for single and multiple patterns) in Java
* [http://www-igm.univ-mlv.fr/~lecroq/string/index.html Exact String Matching Algorithms] — Animation in Java, Detailed description and C implementation of many algorithms.
* [http://www.cs.ucr.edu/~stelo/cpm/cpm04/35_Navarro.pdf (PDF) Improved Single and Multiple Approximate String Matching]
* [http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2647288/ Kalign2: high-performance multiple alignment of protein and nucleotide sequences allowing external features]
| |||