Cargando…
On finding minimal absent words
BACKGROUND: The problem of finding the shortest absent words in DNA data has been recently addressed, and algorithms for its solution have been described. It has been noted that longer absent words might also be of interest, but the existing algorithms only provide generic absent words by trivially...
Autores principales: | Pinho, Armando J, Ferreira, Paulo JSG, Garcia, Sara P, Rodrigues, João MOS |
---|---|
Formato: | Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2009
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2698904/ https://www.ncbi.nlm.nih.gov/pubmed/19426495 http://dx.doi.org/10.1186/1471-2105-10-137 |
Ejemplares similares
-
Minimal Absent Words in Prokaryotic and Eukaryotic Genomes
por: Garcia, Sara P., et al.
Publicado: (2011) -
Minimal Absent Words in Four Human Genome Assemblies
por: Garcia, Sara P., et al.
Publicado: (2011) -
Three minimal sequences found in Ebola virus genomes and absent from human DNA
por: Silva, Raquel M., et al.
Publicado: (2015) -
Linear-time computation of minimal absent words using suffix array
por: Barton, Carl, et al.
Publicado: (2014) -
An alignment-free method to find and visualise rearrangements between pairs of DNA sequences
por: Pratas, Diogo, et al.
Publicado: (2015)