2017/06/09 by Juan David Arcila Moreno, Moreno, Juan David Arcila, Santiago Passos +3
Biochemistry, Genetics and Molecular Biology · Computer Science · #Algorithms and Data Compression #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Gene expression and cancer classification #Genomics and Phylogenetic Studies
paper · pdf · doi:10.48550/arxiv.1706.02828
openalex publication_date 2017/06/09 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
This paper is focused in designing an efficient on-line algorithm to reconstruct a DNA sequence and search the genes in it, we assume that the segment have no mutation or reading error, the algorithm is based on de Bruijn Graph for reconstructing the DNA from the segments taking k-mers large enough no to generate cycles, once the sequence is ready a Boyer-Moore's algorithm implementation is used to search the genes inside de sequence using starts and stop codons, this solution give a high performance when all genes can be found, and there is no need to read all the segments to reach maximum number of genes, but due to the online nature one cannot be sure about the finals genes given