Cargando…
Lossless filter for multiple repeats with bounded edit distance
BACKGROUND: Identifying local similarity between two or more sequences, or identifying repeats occurring at least twice in a sequence, is an essential part in the analysis of biological sequences and of their phylogenetic relationship. Finding such fragments while allowing for a certain number of in...
Autores principales: | Peterlongo, Pierre, Sacomoto, Gustavo Akio Tominaga, do Lago, Alair Pereira, Pisanti, Nadia, Sagot, Marie-France |
---|---|
Formato: | Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2009
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2661881/ https://www.ncbi.nlm.nih.gov/pubmed/19183438 http://dx.doi.org/10.1186/1748-7188-4-3 |
Ejemplares similares
-
A polynomial delay algorithm for the enumeration of bubbles with length constraints in directed graphs
por: Sacomoto, Gustavo, et al.
Publicado: (2015) -
KISSPLICE: de-novo calling alternative splicing events from RNA-seq data
por: Sacomoto, Gustavo AT, et al.
Publicado: (2012) -
Lossless Transformations and Excess Risk Bounds in Statistical Inference
por: Györfi, László, et al.
Publicado: (2023) -
Playing hide and seek with repeats in local and global de novo transcriptome assembly of short RNA-seq reads
por: Lima, Leandro, et al.
Publicado: (2017) -
Fast lossless compression via cascading Bloom filters
por: Rozov, Roye, et al.
Publicado: (2014)