KANDEL, NARAYAN PRASAD2022-01-242022-01-242016-10MASTER OF SCIENCE IN COMPUTER SYSTEM AND KNOWLEDGE ENGINEERINGhttps://hdl.handle.net/20.500.14540/7646Biological sequences Longest Common Subsequence (LCS) identification has significant applications in bioinformatics.Biological sequences Longest Common Subsequence (LCS) identification has significant applications in bioinformatics. Due to the emerging growth of bioinformatics applications, new biological sequences with longer length have been used for processing, making it a great challenge for sequential LCS algorithms. Few parallel LCS algorithms have been proposed but their efficiency and effectiveness are not satisfactory with increasing complexity and size of the biological data. An non-alignment based method of sequence comparison using single layer map reduce based scalable parallel algorithm is presented with some optimization for computing LCS between genetic sequences.enBioinformatics, Longest Common Subsequence,MapReduce, HadoopThesis