Efficient Algorithms for Similarity Search

S. Rajasekaran, Y. Hu, J. Luo, H. Nick, P.M. Pardalos, S. Sahni and G. Shaw
Additional contact information
S. Rajasekaran: University of Florida
Y. Hu: University of Florida
J. Luo: University of Florida
H. Nick: University of Florida
P.M. Pardalos: University of Florida
S. Sahni: University of Florida
G. Shaw: University of Florida

Journal of Combinatorial Optimization, 2001, vol. 5, issue 1, No 9, 125-132

Abstract: Abstract The problem of our interest takes as input a database of m sequences from an alphabet Σ and an integer k. The goal is to report all the pairs of sequences that have a matching subsequence of length at least k. We employ two algorithms to solve this problem. The first algorithm is based on sorting and the second is based on generalized suffix trees. We provide experimental data comparing the performances of these algorithms. The generalized suffix tree based algorithm performs better than the sorting based algorithm.

Keywords: generalized suffix tree (GST); color set size (CSS); quick sort; radix sort (search for similar items in EconPapers)
Date: 2001
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1023/A:1009897903540 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:5:y:2001:i:1:d:10.1023_a:1009897903540

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1023/A:1009897903540

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().