Approximate Alignment Algorithms is a class of computational methods in bioinformatics that perform sequence alignment by allowing controlled mismatches, insertions, and deletions to find inexact matches between biological sequences, distinguishing it from exact alignment techniques through its tolerance for divergence and use of heuristics to enhance scalability and efficiency.
80
Publications
11.8K
Citations
205
Authors
115
Institutions
Publications per year
2017–2026
18
Publications
80
1–5 of 80
Authors
205
- DG
5
h-index
- MA
4
h-index
- OM
4
h-index
- CA
4
h-index
- LW
4
h-index
1–5 of 205
Institutions
115
University of California, Berkeley
Berkeley, United States
5 h-index
12 publications
632 citations
Carnegie Mellon University
Pittsburgh, United States
5 h-index
15 publications
967 citations
ETH Zurich
Zurich, Switzerland
4 h-index
15 publications
932 citations
University of California, Davis
Davis, United States
4 h-index
4 publications
378 citations
Georgia Institute of Technology
Atlanta, United States
4 h-index
14 publications
23.6K citations
Bilkent University
Ankara, Türkiye
4 h-index
10 publications
660 citations
Delft University of Technology
Delft, The Netherlands
3 h-index
7 publications
159 citations
Intel (United States)
Santa Clara, United States
3 h-index
5 publications
341 citations
1–8 of 115
Venues
- Bioinformatics
7 publications · 431 citations
7
h-index
- Journal of Computational Biology
5 publications · 181 citations
5
h-index
- BMC Bioinformatics
3 publications · 53 citations
3
h-index
- bioRxiv (Cold Spring Harbor Laboratory)
Repository · 3 publications · 274 citations
3
h-index
- IEEE/ACM Transactions on Computational Biology and Bioinformatics
3 publications · 165 citations
3
h-index
1–5