DIALIGN-TX: greedy and progressive approaches for segment-based multiple sequence alignment. Background: DIALIGN-T is a reimplementation of the multiple-alignment program DIALIGN. Due to several algorithmic improvements, it produces significantly better alignments on locally and globally related sequence sets than previous versions of DIALIGN. However, like the original implementation of the program, DIALIGN-T uses a a straight-forward greedy approach to assemble multiple alignments from local pairwise sequence similarities. Such greedy approaches may be vulnerable to spurious random similarities and can therefore lead to suboptimal results. In this paper, we present DIALIGN-TX, a substantial improvement of DIALIGN-T that combines our previous greedy algorithm with a progressive alignment approach.
Keywords for this software
References in zbMATH (referenced in 3 articles )
Showing results 1 to 3 of 3.
- Mora-Gutiérrez, Roman Anselmo; Lárraga-Ramírez, María E.; Rincón-García, Eric A.; Ponsich, Antonin; Ramírez-Rodríguez, Javier: Adaptation of the method of musical composition for solving the multiple sequence alignment problem (2015)
- Federico, Maria; Peterlongo, Pierre; Pisanti, Nadia; Sagot, Marie-France: Rime: repeat identification (2014)
- Didier, Gilles; Corel, Eduardo; Laprevotte, Ivan; Grossmann, Alex; Landès-Devauchelle, Claudine: Variable length local decoding and alignment-free sequence comparison (2012)