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

Authors

725

  1. WR
    William R. Pearson

    University of Virginia, United States

    14 publications · 15.3K citations

    13

    h-index

  2. WM
    Webb Miller

    Pennsylvania State University, United States

    3 publications · 228 citations

    3

    h-index

  3. KC
    Kevin Charter

    University of Alberta, Canada

    2 publications · 48 citations

    3

    h-index

  4. ZA
    Zaid Al-Ars

    Delft University of Technology, Netherlands

    3 publications · 99 citations

    3

    h-index

  5. TR
    Torbjørn Rognes

    University of Oslo, Norway

    3 publications · 596 citations

    3

    h-index

1–5 of 725

Venues

  1. Nucleic Acids Research

    37 publications · 9.1K citations

    30

    h-index

  2. Bioinformatics

    33 publications · 3.5K citations

    24

    h-index

  3. BMC Bioinformatics

    10 publications · 10.2K citations

    10

    h-index

  4. Computer applications in the biosciences

    CABIOS · 8 publications · 1.9K citations

    8

    h-index

  5. Molecular Ecology Resources

    4 publications · 679 citations

    4

    h-index

1–5