MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "Finding Approximate Patterns in Strings." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

5 documents found, showing 1 through 5.

ATOM

Identification Of Common Molecular Subsequences
by T.F. Smith, M.S. Waterman — 1981
…:100--118, 1985. [Ukk85b] E. Ukkonen. Finding Approximate Patterns in Strings. Journal of Algorithms, 6…
Cited by 816 (8 self) – Add To MetaCart

CGG90] L. Colussi, Z. Galil, R. Giancarlo. On the Exact Complexity of String Matching. Pro
by Clr Cotmen Leiserson, C. E. Leiserson, R. L. Rivest, Introduction Algorithms, Mcgraw Hill
…-512. [Uk85] E. Ukkonen. Finding approximate patterns in strings. Journal of Algorithms, Vol.6, 1985, 132…
Add To MetaCart

A System for Approximate Tree Matching
by Jason Tsong-Li Wang, Kaizhong Zhang, Karpjoo Jeong, J. T. L. Wang, K. Jeong, K. Zhang, K. Zhang, R. Statman, Dennis Shasha, D. Shasha — 1992
…] E. Ukkonen, \Finding approximate pattern in strings," J. Algorithms, vol. 6, pp. 132-137, 1985. [38…
Cited by 52 (9 self) – Add To MetaCart

HARDWARE ACCELERATION OF SOFTWARE LIBRARY STRING FUNCTIONS
by Dr. Frank Coyle, Pallavi Anil Kulkarni, Pallavi Anil Kulkarni — 2007
… is successful, yielding the required string distance in O(m×d) time. Finding approximate patterns in strings…
Add To MetaCart

Approximate pattern matching is expressible in transitive closure logic
by Kjell Lemström — 2000 — In Proceedings of the 15th annual Symposium on Logic in Computer Science (LICS'2000
… is expressible in FO(TC) (FO(DTC)). In this study, we concentrate on the problem of finding approximate patterns…
Cited by 1 (1 self) – Add To MetaCart

Showing 1 through 5.

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB