Approximate Sequence Matching
Approximate Sequence Matching is a sequence analysis method that identifies similar subsequences across sequences by allowing bounded variations in elements or positions, distinguishing it from exact matching through its tolerance to mismatches, insertions, or deletions.
50
Publications
1.9K
Citations
168
Authors
86
Institutions
Publications per year
2017–2026
10
Parents
50
Sublinear approximate string matching and biological applications
Wonil Chang, Eugene L. Lawler · Algorithmica · 1994 · 186 citations
A compression algorithm for DNA sequences
Xin Chen, Sam Kwong, Ming Li · IEEE Engineering in Medicine and Biology Magazine · 2001 · 93 citations
De novo identification of LTR retrotransposons in eukaryotic genomes
Mina Rho, Jeong-Hyeon Choi, Michael Lynch et al. · BMC Genomics · 2007 · 89 citations · Full text
1–5 of 50
168
3
h-index
3
h-index
2
h-index
2
h-index
2
h-index
1–5 of 168
86
Chinese University of Hong Kong
Hong Kong, Hong Kong
4 h-index
14 publications
373 citations
Boston University
Boston, United States
3 h-index
7 publications
301 citations
Laboratoire d'Informatique Gaspard-Monge
Champs-sur-Marne, France
3 h-index
3 publications
107 citations
Carnegie Mellon University
Pittsburgh, United States
2 h-index
2 publications
22 citations
Austrian Research Institute for Artificial Intelligence
Vienna, Austria
2 h-index
2 publications
90 citations

Lodz University of Technology
Lodz, Poland
2 h-index
2 publications
56 citations

Indian Institute of Science Bangalore
Bengaluru, India
2 h-index
2 publications
103 citations
University of California, Riverside
Riverside, United States
2 h-index
2 publications
103 citations
1–8 of 86
6 publications · 154 citations
6
h-index
CABIOS · 2 publications · 83 citations
2
h-index
Repository · 2 publications · 28 citations
2
h-index
2 publications · 37 citations
2
h-index
2 publications · 26 citations
2
h-index
1–5