Algoritmo di Smith-Waterman

algoritmo di bioinformatica

Wikidata facts

Image: Smith-Waterman.jpg

Sources (3)

via Wikidata · CC0

Article · Italiano

L'algoritmo di Smith–Waterman è un algoritmo di bioinformatica pensato per l'allineamento di sequenze, cioè la determinazione del grado di similarità (detta anche omologia) di sequenze o .

Abstract from DBpedia / Wikipedia · CC BY-SA

Available in 16 languages

Connections

graphics processing unit

Entity

sequence mining

Entity

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

Ford–Fulkerson algorithm

Entitydist 0.64

Steinhaus–Johnson–Trotter algorithm

Entitydist 0.67

merge algorithm

Entitydist 0.68

Category:Lists of sequenced genomes

Entitydist 0.69

Category:Optimization algorithms

Category:Checksum algorithms

Entitydist 0.70

Category:Sam Smith (singer)

Entitydist 0.70

Category:Adam Smith

Entitydist 0.70

genomic structural variation

Entitydist 0.70

Category:Hydromantes

Entitydist 0.71

Algoritmo di Smith-Waterman

Wikidata facts

Article · Italiano

Available in 16 languages

Connections

What links here97 pages

Similar entities

Categories

Similar entities

What links here97 pages