Cargando…
Sequence embedding for fast construction of guide trees for multiple sequence alignment
BACKGROUND: The most widely used multiple sequence alignment methods require sequences to be clustered as an initial step. Most sequence clustering methods require a full distance matrix to be computed between all pairs of sequences. This requires memory and time proportional to N(2 )for N sequences...
Autores principales: | Blackshields, Gordon, Sievers, Fabian, Shi, Weifeng, Wilm, Andreas, Higgins, Desmond G |
---|---|
Formato: | Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2010
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2893182/ https://www.ncbi.nlm.nih.gov/pubmed/20470396 http://dx.doi.org/10.1186/1748-7188-5-21 |
Ejemplares similares
-
Instability in progressive multiple sequence alignment algorithms
por: Boyce, Kieran, et al.
Publicado: (2015) -
Fast, scalable generation of high-quality protein multiple sequence alignments using Clustal Omega
por: Sievers, Fabian, et al.
Publicado: (2011) -
OD-seq: outlier detection in multiple sequence alignments
por: Jehl, Peter, et al.
Publicado: (2015) -
Systematic exploration of guide-tree topology effects for small protein alignments
por: Sievers, Fabian, et al.
Publicado: (2014) -
Protein multiple sequence alignment benchmarking through secondary structure prediction
por: Le, Quan, et al.
Publicado: (2017)