Block edit models for approximate string matching

Author： Lopresti D.   Tomkins A.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.181, Iss.1, 1997-07, pp. : 159-179

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Optimal implementations of the approximate string matching and the approximate discrete signal matching on the memory machine models

By Nakano Koji  

International Journal of Parallel, Emergent and Distributed Systems, Vol. 29, Iss. 2, 2014-03 ,pp. : 104-118

Taylor & Francis Ltd

Access to resources Recommend Favorite

Approximate string matching for music analysis

By Clifford R.   Iliopoulos C.  

Soft Computing, Vol. 8, Iss. 9, 2004-09 ,pp. : 597-603

Springer Publishing Company

Access to resources Recommend Favorite

Compressed Indexes for Approximate String Matching

By Chan Ho-Leung   Lam Tak-Wah   Sung Wing-Kin   Tam Siu-Lung   Wong Swee-Seong  

Algorithmica, Vol. 58, Iss. 2, 2010-10 ,pp. : 263-281

Springer Publishing Company

Access to resources Recommend Favorite

Approximate Boyer-Moore String Matching for Small Alphabets

By Salmela Leena   Tarhio Jorma   Kalsi Petri  

Algorithmica, Vol. 58, Iss. 3, 2010-11 ,pp. : 591-609

Springer Publishing Company

Access to resources Recommend Favorite

Approximate string matching using factor automata

By Holub J.   Melichar B.  

Theoretical Computer Science, Vol. 249, Iss. 2, 2000-10 ,pp. : 305-311

Elsevier

Access to resources Recommend Favorite