Cargando…
A Novel Algorithm for Finding Interspersed Repeat Regions
The analysis of repeats in the DNA sequences is an important subject in bioinformatics. In this paper, we propose a novel projection-assemble algorithm to find unknown interspersed repeats in DNA sequences. The algorithm employs random projection algorithm to obtain a candidate fragment set, and exh...
| Autores principales: | , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Elsevier
2004
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5172473/ https://www.ncbi.nlm.nih.gov/pubmed/15862119 http://dx.doi.org/10.1016/S1672-0229(04)02024-8 |