Efficient Constrained Multiple Sequence Alignment with Performance Guarantee


The Constrained Multiple Sequence Alignment problem is to align a set of sequences subject to a given constrained sequence, which arises from some knowledge of the structure of the sequences. This paper presents new algorithms for this problem, which are more efficient in terms of time and space (memory) than the previous algorithms [14], and with a worst… (More)
DOI: 10.1109/CSB.2003.1227334

5 Figures and Tables


  • Presentations referencing similar topics