Cargando…
Two Efficient Techniques to Find Approximate Overlaps between Sequences
The next-generation sequencing (NGS) technology outputs a huge number of sequences (reads) that require further processing. After applying prefiltering techniques in order to eliminate redundancy and to correct erroneous reads, an overlap-based assembler typically finds the longest exact suffix-pref...
Autor principal: | Haj Rachid, Maan |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Hindawi Publishing Corporation
2017
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5331309/ https://www.ncbi.nlm.nih.gov/pubmed/28293632 http://dx.doi.org/10.1155/2017/2731385 |
Ejemplares similares
-
A Practical and Scalable Tool to Find Overlaps between Sequences
por: Haj Rachid, Maan, et al.
Publicado: (2015) -
Approximation techniques for engineers /
por: Komzsik, Louis
Publicado: (2007) -
Approximation techniques for engineers
por: Komzsik, Louis
Publicado: (2006) -
Simple and efficient estimation of photovoltaic cells and modules parameters using approximation and correction technique
por: Muhammad, Fahmi F., et al.
Publicado: (2019) -
Using the Sadakane Compressed Suffix Tree to Solve the All-Pairs Suffix-Prefix Problem
por: Haj Rachid, Maan, et al.
Publicado: (2014)