Using the Sadakane Compressed Suffix Tree to Solve the All-Pairs Suffix-Prefix Problem

The all-pairs suffix-prefix matching problem is a basic problem in string processing. It has an application in the de novo genome assembly task, which is one of the major bioinformatics problems. Due to the large size of the input data, it is crucial to use fast and space efficient solutions. In thi...

Descripción completa

Detalles Bibliográficos
Autores principales: Haj Rachid, Maan, Malluhi, Qutaibah, Abouelhoda, Mohamed
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Hindawi Publishing Corporation 2014
Materias:
Research Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4009283/
https://www.ncbi.nlm.nih.gov/pubmed/24834435
http://dx.doi.org/10.1155/2014/745298

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4009283/
https://www.ncbi.nlm.nih.gov/pubmed/24834435
http://dx.doi.org/10.1155/2014/745298

Ejemplares similares