Cargando…
A Practical and Scalable Tool to Find Overlaps between Sequences
The evolution of the next generation sequencing technology increases the demand for efficient solutions, in terms of space and time, for several bioinformatics problems. This paper presents a practical and easy-to-implement solution for one of these problems, namely, the all-pairs suffix-prefix prob...
Autores principales: | Haj Rachid, Maan, Malluhi, Qutaibah |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Hindawi Publishing Corporation
2015
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4417569/ https://www.ncbi.nlm.nih.gov/pubmed/25961045 http://dx.doi.org/10.1155/2015/905261 |
Ejemplares similares
-
Using the Sadakane Compressed Suffix Tree to Solve the All-Pairs Suffix-Prefix Problem
por: Haj Rachid, Maan, et al.
Publicado: (2014) -
Two Efficient Techniques to Find Approximate Overlaps between Sequences
por: Haj Rachid, Maan
Publicado: (2017) -
PredictPTB: an interpretable preterm birth prediction model using attention-based recurrent neural networks
por: AlSaad, Rawan, et al.
Publicado: (2022) -
Assessment of de novo assemblers for draft genomes: a case study with fungal genomes
por: Abbas, Mostafa M, et al.
Publicado: (2014) -
FastRNABindR: Fast and Accurate Prediction of Protein-RNA Interface Residues
por: EL-Manzalawy, Yasser, et al.
Publicado: (2016)