Cargando…
A fast algorithm for determining the best combination of local alignments to a query sequence
BACKGROUND: Existing sequence alignment algorithms assume that similarities between DNA or amino acid sequences are linearly ordered. That is, stretches of similar nucleotides or amino acids are in the same order in both sequences. Recombination perturbs this order. An algorithm that can reconstruct...
Autores principales: | Conant, Gavin C, Wagner, Andreas |
---|---|
Formato: | Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2004
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC436051/ https://www.ncbi.nlm.nih.gov/pubmed/15149555 http://dx.doi.org/10.1186/1471-2105-5-62 |
Ejemplares similares
-
Choosing the best heuristic for seeded alignment of DNA sequences
por: Sun, Yanni, et al.
Publicado: (2006) -
Aligning text mining and machine learning algorithms with best practices for study selection in systematic literature reviews
por: Popoff, E., et al.
Publicado: (2020) -
Overview of the VA Quality Enhancement Research Initiative (QUERI) and QUERI theme articles: QUERI Series
por: Stetler, Cheryl B, et al.
Publicado: (2008) -
Fast and sensitive multiple alignment of large genomic sequences
por: Brudno, Michael, et al.
Publicado: (2003) -
Accel-Align: a fast sequence mapper and aligner based on the seed–embed–extend method
por: Yan, Yiqing, et al.
Publicado: (2021)