Title :
A data structure for approximate string searching
Author :
Roos, Thomas ; Shi, Fei ; Widmayer, Peter
Author_Institution :
Dept. of Comput. Sci., Federal Inst. of Technol., Zurich, Switzerland
Abstract :
Summary form only given. The problem of searching for approximate occurrences of a pattern in a set of strings is called the approximate string searching problem. The recent interest in this problem comes from DNA sequence analysis: whenever a sequence investigator determines a new sequence, one of the first things he must do is to compare it with all available sequences to see if it resembles something already known. The authors provide a data structure for approximate string searching and discuss the searching algorithm.<>
Keywords :
data structures; query processing; search problems; DNA sequence analysis; approximate occurrences; approximate string searching; data structure; database; query string; searching algorithm;
Conference_Titel :
System Sciences, 1994. Proceedings of the Twenty-Seventh Hawaii International Conference on
Conference_Location :
Wailea, HI, USA
Print_ISBN :
0-8186-5090-7
DOI :
10.1109/HICSS.1994.323592
