An Efficient Matching Algorithm for Encoded DNA Sequences and Binary Strings
作者： Simone Faro , Thierry Lecroq
DOI: 10.1007/978-3-642-02441-2_10
关键词:
摘要: We present a new efficient algorithm for exact matching in encoded DNA sequences and on binary strings. Our combines multi-pattern version of the B ndm simplified C ommentz-Walter algorithm. performed also experimental comparisons with most algorithms presented literature. Experimental results show that newly outperforms existing solutions cases.
springer.com
sci-hub.st 参考文章(15)
Thierry Lecroq, Christian Charras, Joseph Daniel Pehoushek, A Very Fast String Matching Algorithm for Small Alphabeths and Long Patterns (Extended Abstract) combinatorial pattern matching. pp. 55- 64 ,(1998)
Christian Charras, Thierry Lecrog, Joseph Daniel Pehoushek, A very fast string matching algorithm for small alphabets and long patterns combinatorial pattern matching. pp. 55- 64 ,(1998) , 10.1007/BFB0030780
Shmuel T. Klein, Miri Kopel Ben-Nissan, Accelerating Boyer Moore searches on binary texts international conference on implementation and application of automata. pp. 130- 143 ,(2007) , 10.1007/978-3-540-76336-9_14
Jin Wook Kim, Eunsang Kim, Kunsoo Park, Fast Matching Method for DNA Sequences Combinatorics, Algorithms, Probabilistic and Experimental Methodologies. pp. 271- 281 ,(2007) , 10.1007/978-3-540-74450-4_25
Beate Commentz-Walter, A String Matching Algorithm Fast on the Average international colloquium on automata, languages and programming. pp. 118- 132 ,(1979) , 10.1007/3-540-09510-1_10
Pavlos Antoniou, Jan Holub, Costas S. Iliopoulos, Bořivoj Melichar, Pierre Peterlongo, Finding Common Motifs with Gaps Using Finite Automata Implementation and Application of Automata. ,vol. 4094, pp. 69- 77 ,(2006) , 10.1007/11812128_8
Matthew Hennessy, Robin Milner, On Observing Nondeterminism and Concurrency international colloquium on automata, languages and programming. pp. 299- 309 ,(1980) , 10.1007/3-540-10003-2_79
Thierry Lecroq, Simone Faro, Efficient Pattern Matching on Binary Strings arXiv: Data Structures and Algorithms. ,(2008)
Gonzalo Navarro, Mathieu Raffinot, A Bit-Parallel Approach to Suffix Automata: Fast Extended String Matching combinatorial pattern matching. pp. 14- 33 ,(1998) , 10.1007/BFB0030778
Daniel M. Sunday, A very fast substring search algorithm Communications of the ACM. ,vol. 33, pp. 132- 142 ,(1990) , 10.1145/79173.79184