A parallel non-alignment based approach to efficient sequence comparison using longest common subsequences

S. Bhowmick, M. Shafiullah, H. Rai, D. Bastola

Research output: Contribution to journalArticle

1 Scopus citations


Biological sequence comparison programs have revolutionized the practice of biochemistry, and molecular and evolutionary biology. Pairwise comparison of genomic sequences is a popular method of choice for analyzing genetic sequence data. However the quality of results from most sequence comparison methods are significantly affected by small perturbations in the data and furthermore, there is a dearth of computational tools to compare sequences beyond a certain length. In this paper, we describe a parallel algorithm for comparing genetic sequences using an alignment free-method based on computing the Longest Common Subsequence (LCS) between genetic sequences. We validate the quality of our results by comparing the phylogenetic tress obtained from ClustalW and LCS. We also show through complexity analysis of the isoefficiency and by empirical measurement of the running time that our algorithm is very scalable.

Original languageEnglish (US)
Article number012012
JournalJournal of Physics: Conference Series
Issue number1
StatePublished - Jan 1 2010


ASJC Scopus subject areas

  • Physics and Astronomy(all)

Cite this