The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
HAlign: Fast multiple similar DNA/RNA sequence alignment based on the centre star strategy
Abstract
Motivation: Multiple sequence alignment (MSA) is important work, but bottlenecks arise in the massive MSA of homologous DNA or genome sequences. Most of the available state-of-the-art software tools cannot address large-scale datasets, or they run rather slowly. The similarity of homologous DNA sequences is often ignored. Lack of parallelization is still a challenge for MSA research. Results: We developed two software tools to address the DNA MSA problem. The first employed trie trees to accelerate the centre star MSA strategy. The expected time complexity was decreased to linear time from square time. To address large-scale data, parallelism was applied using the hadoop platform. Experiments demonstrated the performance of our proposed methods, including their running time, sum-of-pairs scores and scalability. Moreover, we supplied two massive DNA/RNA MSA datasets for further testing and research. Availability and implementation: The codes, tools and data are accessible free of charge at http://datamining.xmu.edu.cn/software/halign/. Contact: zouquan@nclab.net or ghwang@hit.edu.cn
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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 Multiple Sequence Alignment Software Version 7: Improvements in Performance and Usability
Katoh, K., & Standley, D. M. (2013) · Molecular Biology and Evolution · doi:10.1093/molbev/mst010 · Cited by 46,209
<tt>BLAT</tt> —The <tt>BLAST</tt> -Like Alignment Tool
Kent, W. J. (2002) · Genome Research · doi:10.1101/gr.229202 · Cited by 8,480
The Pfam protein families database
Finn, R. D., Mistry, J., Tate, J., Coggill, P., Heger, A., Pollington, J. E., Gavin, O. L., Gunasekaran, P., Ceric, G., Forslund, K., et al. (2010) · Nucleic Acids Research · doi:10.1093/nar/gkp985 · Cited by 2,694
Rfam: Wikipedia, clans and the “decimal” release
Gardner, P. P., Daub, J., Tate, J., Moore, B. L., Osuch, I. H., Griffiths-Jones, S., Finn, R. D., Nawrocki, E. P., Kolbe, D. L., Eddy, S. R., et al. (2011) · Nucleic Acids Research · doi:10.1093/nar/gkq1129 · Cited by 390
Thompson, J. D., Linard, B., Lecompte, O., & Poch, O. (2011) · PLoS ONE · doi:10.1371/journal.pone.0018093 · Cited by 242
Cited by
Distance-based Support Vector Machine to Predict DNA N6- methyladenine Modification
Zhang, H., Zou, Q., Ju, Y., Song, C., & Chen, D. (2022) · Current Bioinformatics · doi:10.2174/1574893617666220404145517 · Cited by 316
Self-citationFinding the Best Classification Threshold in Imbalanced Classification
Zou, Q., Xie, S., Lin, Z., Wu, M., & Ju, Y. (2016) · Big Data Research · doi:10.1016/j.bdr.2015.12.001 · Cited by 281
Self-citationSu, W., Liao, X., Lu, Y., Zou, Q., & Peng, S. (2017) · Journal of Computational Biology · doi:10.1089/cmb.2017.0040 · Cited by 21
Self-citationComputational Strategies for Scalable Genomics Analysis
Shi, L., & Wang, Z. (2019) · Genes · doi:10.3390/genes10121017 · Cited by 19
Metadata
- Authors
- Zou, Q., Hu, Q., Guo, M., & Wang, G.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2015-04-10
- Volume
- 31
- Issue
- 15
- Pages
- 2475-2481
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2119270998
- Cited by
- 159
- References
- 5
- FWCI
- 10.29
- Type
- journal article
- Language
- en
- Open access
- closed
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
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.