Cargando...
A Pairwise Alignment Algorithm for Long Sequences of High Similarity
Alignment algorithms are important in bioinformatics for comparing the similarity among sequences. The algorithm of Needleman–Wunsch is well known for globally aligning two sequences. However, this algorithm is unsuitable for sequences of long length. Many heuristic algorithms are proposed, such as...
Guardado en:
| Publicado en: | Information and Communication Technology |
|---|---|
| Autores principales: | , |
| Formato: | Artigo |
| Lenguaje: | Inglês |
| Publicado: |
2017
|
| Materias: | |
| Acceso en línea: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7123042/ https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/978-981-10-5508-9_27 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|