A partition-based efficient algorithm for large scale multiple-strings matching

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3772 LNCS, Issue , 2005, Pages 399-404

  Liu, Ping ^a   Liu, Yan Bing ^a   Tan, Jian Long ^a  

^a INSTITUTE OF COMPUTING TECHNOLOGY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

DATA PROCESSING; INFORMATION RETRIEVAL; INTERNET; PROBLEM SOLVING; SET THEORY;

CLASSICAL ALGORITHMS; MULTIPLE-STRINGS MATCHING; PARTITION STRATEGY; PARTITION-BASED EFFICIENT ALGORITHM;

ALGORITHMS;

EID: 33646723680     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11575832_44     Document Type: Conference Paper

References (13)

1. Gonzalo Navarro and Mathieu Raffinot, "Flexible Pattern Matching in StringsPractical on-line search algorithms for texts and biological sequences", Camedge University Press, 2002, ISBN 0-521-81307-7. pp15-17, 74-76
2. D.E.Knuth, J.H.Morris, V.R.Pratt, "Fast Pattern Matching in Strings", SIAM Journal on Computing, Page 323-350, 1977
3. A.V. Aho and M.J.Corasick, "Efficient string matchingan aid to bibliographic search", Communication of the ACM, 18(6):333-340, 1975
4. S. Wu, U. Manber, "Fast text searching allowing errors", Communications of the ACM, 35(10): 83-91, 1992
5. R.S.Boyer, J.S.Moore, "A fast string searching algorithm", Communications of the ACM, 20(10):762-772, 1977
6. B.Commentz-Walter, "A string matching algorithm fast on the average", In Proceedings of the 6th International Colloquium on Automata, Language and Programming, number 71 in Lecture Notes in Computer Science, pages 118-132, 1979
7. S.Wu, U.Manber, "A fast algorithm for multi-pattern searching", Report TR-94-17, Department of Computer Science, University of Arizona, Tucson, AZ, 1994
8. M.Crochemore, A.Czumaj, L.Gasienniec, S.Jarominek, T.Lecroq, W.Plandowski, W.Rytter, "Speeding up two string matching algorithms", Algorithmica, 12(4/5):247-267, 1994
9. C.Allauzen, M.Crochemore, M.Raffinot, "Efficient experimental string matching by weak factor recognition", In proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching, number 2089 in Lecture Notes in Computer Science, pages51-72. Springer-Verlag, 2001
10. A.Blumer, J.Blumer, A.Ehrenfeucht, D.Haussier, R.McConnel. "Complete inverted files for efficient text retrieval and analysis", Jonual of the ACM, 34(3):578-595, 1987
11. C.Allauzen, M.Raffinot "Factor oracle of a set of words", Technical report 99-11, Institute Gaspard-Monge, University de Marne-la-vallee, 1999
12. Xiaodong Wang "The Design and Analysis of Computer Algorithms" Publishing House of Electronic Industry, Beijing. 2001ISBN7-5053-6391-3P38-81
13. Gonzalo Navarro, Kimmo Fredriksson. "Average Complexity of Exact and Approximate Multiple String Matching", Theoretical Computer Science (TCS) 321 (2-3):283-290, 2004