Jump to content

DIALIGN-TX

Edit links
From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Tom.Reding (talk | contribs) at 15:15, 29 June 2016 (→External links: Rem stub tag(s) (class = non-stub & non-list) using AWB). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

DIALIGN-TX is a multiple sequence alignment program written by Amarendran R. Subramanian and is substantial improvement of DIALIGN-T by combining greedy and progressive alignment strategies in a new algorithm.

The original 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 straightforward 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. DIALIGN-TX is a substantial improvement of DIALIGN-T that combines the previous greedy algorithm with a progressive alignment approach.

See also

References

  • Subramanian AR, Kaufmann M, Morgenstern B. DIALIGN-TX: Greedy and progressive approaches for segment-based multiple sequence alignment. Algorithms for Molecular Biology 2008, 3:6
  • Subramanian AR, Weyer-Menkhoff J, Kaufmann M, Morgenstern B. DIALIGN-T: An improved algorithm for segment-based multiple sequence alignment. BMC Bioinformatics 2005, 6:66
Retrieved from "https://en.wikipedia.org/w/index.php?title=DIALIGN-TX&oldid=727524708"