2012/10/31 by Sandeep Hosangadi, Hosangadi, Sandeep, Subhash Kak +1
Biochemistry, Genetics and Molecular Biology · Computer Science · #Algorithms and Data Compression #DNA and Biological Computing #FOS: Computer and information sciences #Information Theory (cs.IT) #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1210.8398
openalex publication_date 2012/10/31 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
This paper describes a new alignment algorithm for sequences that can be used for determination of deletions and substitutions. It provides several solutions out of which the best one can be chosen on the basis of minimization of gaps or other considerations. The algorithm does not use similarity tables and it performs aspects of both global and local alignment. The algorithm is compared with other sequence alignment algorithms.