On-line string matching with feedback

Author： Johansen P.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.141, Iss.1, 1995-04, pp. : 53-67

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

On-line matching routing on trees

By Roberts A.   Symvonis A.  

Theoretical Computer Science, Vol. 220, Iss. 2, 1999-06 ,pp. : 469-488

Elsevier

Access to resources Recommend Favorite

On-line feedback-based automatic resource configuration for distributed applications

By Liu Hao   Sørensen Søren-Aksel  

Cluster Computing, Vol. 13, Iss. 4, 2010-12 ,pp. : 397-419

Springer Publishing Company

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

Fast parallel string prefix-matching

By Breslauer D.  

Theoretical Computer Science, Vol. 137, Iss. 2, 1995-01 ,pp. : 269-278

Elsevier

Access to resources Recommend Favorite