Cargando…
Choosing the best heuristic for seeded alignment of DNA sequences
BACKGROUND: Seeded alignment is an important component of algorithms for fast, large-scale DNA similarity search. A good seed matching heuristic can reduce the execution time of genomic-scale sequence comparison without degrading sensitivity. Recently, many types of seed have been proposed to improv...
Autores principales: | Sun, Yanni, Buhler, Jeremy |
---|---|
Formato: | Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2006
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC1468433/ https://www.ncbi.nlm.nih.gov/pubmed/16533404 http://dx.doi.org/10.1186/1471-2105-7-133 |
Ejemplares similares
-
Heuristics for multiobjective multiple sequence alignment
por: Abbasi, Maryam, et al.
Publicado: (2016) -
Accel-Align: a fast sequence mapper and aligner based on the seed–embed–extend method
por: Yan, Yiqing, et al.
Publicado: (2021) -
A fast algorithm for determining the best combination of local alignments to a query sequence
por: Conant, Gavin C, et al.
Publicado: (2004) -
An improved alignment-free model for dna sequence similarity metric
por: Bao, Junpeng, et al.
Publicado: (2014) -
Aligning text mining and machine learning algorithms with best practices for study selection in systematic literature reviews
por: Popoff, E., et al.
Publicado: (2020)