Fasta Algorithms
FASTA Algorithms is a computational method in bioinformatics that distinguishes itself by employing heuristic techniques to rapidly identify regions of local sequence similarity between nucleotide or protein sequences through initial k-mer matching followed by optimal alignment refinement.
225
Publications
56.3K
Citations
725
Authors
341
Institutions
Publications per year
2017–2026
46
Variants
Fasta
Parents
225
Ronny Lorenz, Christian Höner zu Siederdissen, Hakim Tafer et al. · Algorithms for Molecular Biology · 2011 · 5.4K citations · Full text
Multiple sequence alignment with the Clustal series of programs
Nucleic Acids Research · 2003 · 4.9K citations · Full text
1–5 of 225
725
13
h-index
3
h-index
3
h-index
3
h-index
3
h-index
1–5 of 725
341
University of Virginia
Charlottesville, United States
12 h-index
15 publications
24.9K citations
University of Washington
Seattle, United States
7 h-index
13 publications
1.3K citations

Centre National de la Recherche Scientifique
Paris, France
7 h-index
11 publications
1.5K citations
National Institutes of Health
Bethesda, United States
5 h-index
11 publications
621 citations

Sorbonne Université
Paris, France
4 h-index
6 publications
1.1K citations

Fundação Oswaldo Cruz
Rio de Janeiro, Brazil
4 h-index
9 publications
604 citations
Harvard University
Cambridge, United States
3 h-index
9 publications
400 citations
Stony Brook University
Stony Brook, United States
3 h-index
13 publications
848 citations
1–8 of 341
37 publications · 9.1K citations
30
h-index
33 publications · 3.5K citations
24
h-index
10 publications · 10.2K citations
10
h-index
CABIOS · 8 publications · 1.9K citations
8
h-index
4 publications · 679 citations
4
h-index
1–5