The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
DIALIGN-TX: greedy and progressive approaches for segment-based multiple sequence alignment
Open accessAbstract
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. RESULTS: Our new heuristic produces significantly better alignments, especially on globally related sequences, without increasing the CPU time and memory consumption exceedingly. The new method is based on a guide tree; to detect possible spurious sequence similarities, it employs a vertex-cover approximation on a conflict graph. We performed benchmarking tests on a large set of nucleic acid and protein sequences For protein benchmarks we used the benchmark database BALIBASE 3 and an updated release of the database IRMBASE 2 for assessing the quality on globally and locally related sequences, respectively. For alignment of nucleic acid sequences, we used BRAliBase II for global alignment and a newly developed database of locally related sequences called DIRM-BASE 1. IRMBASE 2 and DIRMBASE 1 are constructed by implanting highly conserved motives at random positions in long unalignable sequences. CONCLUSION: On BALIBASE3, our new program performs significantly better than the previous program DIALIGN-T and outperforms the popular global aligner CLUSTAL W, though it is still outperformed by programs that focus on global alignment like MAFFT, MUSCLE and T-COFFEE. On the locally related test sets in IRMBASE 2 and DIRM-BASE 1, our method outperforms all other programs while MAFFT E-INSi is the only method that comes close to the performance of DIALIGN-TX.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
MAFFT: a novel method for rapid multiple sequence alignment based on fast Fourier transform
Katoh, K. (2002) · Nucleic Acids Research · doi:10.1093/nar/gkf436 · Cited by 17,027
Individual Comparisons by Ranking Methods
Wilcoxon, F. (1945) · Biometrics Bulletin · doi:10.2307/3001968 · Cited by 15,354
Stanke, M., Schöffmann, O., Morgenstern, B., & Waack, S. (2006) · BMC Bioinformatics · doi:10.1186/1471-2105-7-62 · Cited by 1,304
Self-citationDIALIGN 2: improvement of the segment-to-segment approach to multiple sequence alignment.
Morgenstern, B. (1999) · Bioinformatics · doi:10.1093/bioinformatics/15.3.211 · Cited by 678
Self-citation
Cited by
iRegulon: From a Gene List to a Gene Regulatory Network Using Large Motif and Track Collections
Janky, R., Verfaillie, A., Imrichová, H., Van de Sande, B., Standaert, L., Christiaens, V., Hulselmans, G., Herten, K., Naval Sanchez, M., Potier, D., et al. (2014) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1003731 · Cited by 900
Three crocodilian genomes reveal ancestral patterns of evolution among archosaurs
Green, R. E., Braun, E. L., Armstrong, J., Earl, D., Nguyen, N., Hickey, G., Vandewege, M. W., St. John, J. A., Capella-Gutiérrez, S., Castoe, T. A., et al. (2014) · Science · doi:10.1126/science.1254449 · Cited by 359
Bradley, R. K., Roberts, A., Smoot, M., Juvekar, S., Do, J., Dewey, C., Holmes, I., & Pachter, L. (2009) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1000392 · Cited by 353
Alves, R. J. E., Minh, B. Q., Urich, T., von Haeseler, A., & Schleper, C. (2018) · Nature Communications · doi:10.1038/s41467-018-03861-1 · Cited by 344
The pharmacological landscape and therapeutic potential of serine hydrolases
Bachovchin, D. A., & Cravatt, B. F. (2012) · Nature Reviews Drug Discovery · doi:10.1038/nrd3620 · Cited by 308
Metadata
- Authors
- Subramanian, A. R., Kaufmann, M., & Morgenstern, B.
- Venue
- Algorithms for Molecular Biology
- Published
- 2008-05-27
- Volume
- 3
- Issue
- 1
- Pages
- 6-6
- ISSN
- 1748-7188 (ISSN-L)
- OpenAlex
- W2143357251
- Cited by
- 229
- References
- 4
- FWCI
- 8.81
- Type
- journal article
- Language
- en
- Open access
- gold
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: DIALIGN-TX: greedy and progressive approaches for segment-based multiple sequence alignment. https://app.cochat.ai/papers/10.1186/1748-7188-3-6
- The paper
- Subramanian, A. R., Kaufmann, M., & Morgenstern, B. (2008). DIALIGN-TX: greedy and progressive approaches for segment-based multiple sequence alignment. Algorithms for Molecular Biology. https://doi.org/10.1186/1748-7188-3-6
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.