BioinformaticsJournal of Computational BiologyPeer-reviewed
On the Complexity of Sequence to Graph Alignment
Chirag Jain, Haowen Zhang, Yu Feng Gao, Srinivas Aluru
This paper proves sequence to graph alignment is NP-complete under Hamming and edit distances for alphabets of size ≥2 and presents an efficient algorithm for when only sequence changes are allowed.
47 citations