Linear nondeterministic Dawg string matching algorithm (Abstract)

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

Volumn 3246, Issue , 2004, Pages 70-71

  He, Longtao ^a   Fang, Binxing ^a  

^a HARBIN INSTITUTE OF TECHNOLOGY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84933497259     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30213-1_8     Document Type: Conference Paper

References (1)

1. Navarro, G., Raffinot, M.: Fast and flexible string matching by combining bitparallelism and suffix automata. ACM Journal of Experimental Algorithmics (JEA) 5 (2000)