A fast and memory efficient MLCS algorithm by character merging for DNA sequences alignment
Sign Up to like & getrecommendations! Published in 2020 at "Bioinformatics"
DOI: 10.1093/bioinformatics/btz725
Abstract: MOTIVATION Multiple Longest Common Subsequence (MLCS) problem is searching all longest common subsequences of multiple character sequences. It appears in many fields such as data mining, DNA alignment, bioinformatics, text editing and so on. With… read more here.
Keywords: character merging; dna sequences; character; fast memory ... See more keywords