Year: 2012
Type: preprint
Abstract: 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.
Source: arXiv (Cornell University)
Authors: Hosangadi, Sandeep, Kak, Subhash
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W1820113573