DNA Sequence Compression Using Adaptive Particle Swarm Optimization-Based Memetic Algorithm
The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
With the rapid development of high-throughput DNA sequencing technologies, the amount of DNA sequence data is accumulating exponentially. The huge influx of data creates new challenges for storage and transmission. This paper proposes a novel adaptive particle swarm optimization-based memetic algorithm (POMA) for DNA sequence compression. POMA is a synergy of comprehensive learning particle swarm optimization (CLPSO) and an adaptive intelligent single particle optimizer (AdpISPO)-based local search. It takes advantage of both CLPSO and AdpISPO to optimize the design of approximate repeat vector (ARV) codebook for DNA sequence compression. ARV is first introduced in this paper to represent the repeated fragments across multiple sequences in direct, mirror, pairing, and inverted patterns. In POMA, candidate ARV codebooks are encoded as particles and the optimal solution, which covers the most approximate repeated fragments with the fewest base variations, is identified through the exploration and exploitation of POMA. In each iteration of POMA, the leader particles in the swarm are selected based on weighted fitness values and each leader particle is fine-tuned with an AdpISPO-based local search, so that the convergence of the search in local region is accelerated. A detailed comparison study between POMA and the counterpart algorithms is performed on 29 (23 basic and 6 composite) benchmark functions and 11 real DNA sequences. POMA is observed to obtain better or competitive performance with a limited number of function evaluations. POMA also attains lower bits-per-base than other state-of-the-art DNA-specific algorithms on DNA sequence data. The experimental results suggest that the cooperation of CLPSO and AdpISPO in the framework of memetic algorithm is capable of searching the ARV codebook space efficiently.
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
Sequencing technologies – the next generation
Metzker, M. L. (2010) · Nature Reviews Genetics · doi:10.1038/nrg2626 · Cited by 7,066 · cited 2×
“Particularly, candidate pair settings of a ∈ [−X̂, X̂] and p ∈ [1, 60] are randomly generated and encoded in a particle swarm psl.”
BackgroundPowell, M. J. D. (1964) · The Computer Journal · doi:10.1093/comjnl/7.2.155 · Cited by 4,632 · cited 6×
“TABLE V Performances of the Algorithms on Benchmark DNA Sequences for 30 Independent Runs PSOw CLPSO ISPO AdpISPO POMA CLPSO-DFP CLPSO-DSCG Mean 1.8654E+00 1.7309E+00 1.7839E+00 1.7417E+00 1.5360E+00† 1.6307E+00 1.6523E+00 Var.”
MethodInfluential
Cited by
A Competitive Swarm Optimizer for Large Scale Optimization
Cheng, R., & Jin, Y. (2015) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2014.2322602 · Cited by 1,052
“Due to its conceptual simplicity and high search efficiency, PSO has attracted much research interest over the past decades and has been successfully applied to a number of applications, such as water distribution network design [6], parameter optimization in suspension system [7], resource allocation [8], task assign…”
BackgroundA social learning particle swarm optimization algorithm for scalable optimization
Cheng, R., & Jin, Y. (2015) · Information Sciences · doi:10.1016/j.ins.2014.08.039 · Cited by 747
“, water distribution network design [56], resource allocation [24], task assignment [30], maximum power point tracker for photovoltaic system [36], optimal control [67], DNA sequence compression [100] and reconstruction of gene regulatory network [60], image processing [69], text clustering [6] and many others [75,34,…”
BackgroundGong, M., Cai, Q., Chen, X., & Ma, L. (2014) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2013.2260862 · Cited by 394
Efficient DNA sequence compression with neural networks
Silva, M., Pratas, D., & Pinho, A. J. (2020) · GigaScience · doi:10.1093/gigascience/giaa119 · Cited by 57
Metadata
- Authors
- Zhu, Z., Zhou, J., Ji, Z., & Shi, Y.-H.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2011-10
- Volume
- 15
- Issue
- 5
- Pages
- 643-658
- ISSN
- 1089-778X (ISSN-L)
- 1941-0026
- OpenAlex
- W2131694312
- Cited by
- 109
- References
- 2
- FWCI
- 7.98
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: DNA Sequence Compression Using Adaptive Particle Swarm Optimization-Based Memetic Algorithm. https://app.cochat.ai/papers/10.1109/tevc.2011.2160399
- The paper
- Zhu, Z., Zhou, J., Ji, Z., & Shi, Y.-H. (2011). DNA Sequence Compression Using Adaptive Particle Swarm Optimization-Based Memetic Algorithm. IEEE Transactions on Evolutionary Computation. https://doi.org/10.1109/tevc.2011.2160399
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.