The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
Finding low autocorrelation binary sequences with memetic algorithms
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The best-known heuristic for general LABS is tabu search initialized with a memetic algorithm (Memetic Tabu).
“The best-known heuristic for general LABS is tabu search initialized with a memetic algorithm (Memetic Tabu) (23), and has a running time that scales as 1.34N (30).”
From Evidence of scaling advantage for the quantum approximate optimization algorithm on a classically intractable problem (2024) · cites this paper as [23]
Citations
Cites
Glover, F., & Laguna, M. (1997) · Cited by 5,679
Glover, F., & Kochenberger, G. A. (2003) · International series in management science/operations research/International series in operations research & management science · doi:10.1007/b101874 · Cited by 3,439
Corne, D., Dorigo, M., Glover, F., Dasgupta, D., Moscato, P., Poli, R., & Price, K. V. (1999) · Cited by 2,136
Gallager, R. G., & Peterson, W. W. (1962) · Mathematics of Computation · doi:10.2307/2003832 · Cited by 2,065
Stochastic Local Search: Foundations & Applications
Hoos, H. H., & St�tzle, T. (2004) · Medical Entomology and Zoology · Cited by 1,227
A Tutorial for Competent Memetic Algorithms: Model, Taxonomy, and Design Issues
Krasnogor, N., & Smith, J. E. (2005) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2005.850260 · Cited by 728
A Gentle Introduction to Memetic Algorithms
Moscato, P., & Cotta, C. (2006) · Kluwer Academic Publishers eBooks · doi:10.1007/0-306-48056-5_5 · Cited by 464
Self-citationMemetic algorithms: a short introduction
Moscato, P. (1999) · McGraw-Hill Ltd., UK eBooks · Cited by 446
Recent Advances in Memetic Algorithms
Hart, W. E., Smith, J. E., & Krasnogor, N. (2005) · Springer eBooks · doi:10.1007/3-540-32363-5 · Cited by 441
Landscapes and their correlation functions
Stadler, P. F. (1996) · Journal of Mathematical Chemistry · doi:10.1007/bf01165154 · Cited by 253
Sieves for low autocorrelation binary sequences
Golay, M. (1977) · IEEE Transactions on Information Theory · doi:10.1109/tit.1977.1055653 · Cited by 225
The merit factor of long low autocorrelation binary sequences (Corresp.)
Golay, M. (1982) · IEEE Transactions on Information Theory · doi:10.1109/tit.1982.1056505 · Cited by 196
Low autocorrelation binary sequences : statistical mechanics and configuration space analysis
Bernasconi, J. (1987) · Journal de physique · doi:10.1051/jphys:01987004804055900 · Cited by 188
Turyn, R. J., & Storer, J. (1961) · Proceedings of the American Mathematical Society · doi:10.1090/s0002-9939-1961-0125026-2 · Cited by 153
Exhaustive Search for Low-Autocorrelation Binary SequencesPreprint
Mertens, S. (1996) · Cited by 98
Hoos, H. H., & Stϋtzle, T. (2018) · Chapman & Hall/CRC eBooks · doi:10.1201/9781351236423-17 · Cited by 96
Exhaustive search for low-autocorrelation binary sequences
Mertens, S. (1996) · Journal of Physics A Mathematical and General · doi:10.1088/0305-4470/29/18/005 · Cited by 91
Evolutionary search for low autocorrelated binary sequences
Militzer, B., Zamparelli, M., & Beule, D. (1998) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.728212 · Cited by 85
Low autocorrelation binary sequences: exact enumeration and optimization by evolutionary strategies
de Groot, C., Würtz, D., & Hoffmann, K. H. (1992) · Optimization · doi:10.1080/02331939208843771 · Cited by 68
A new search for skewsymmetric binary sequences with optimal merit factors
Golay, M. J. E., & Harris, D. B. (1990) · IEEE Transactions on Information Theory · doi:10.1109/18.57219 · Cited by 58
Stranneby, D., & Walker, W. (2004) · Elsevier eBooks · doi:10.1016/b978-075066344-1/50008-2 · Cited by 35
Optimization by simulating molecular evolution
Wang, Q. (1987) · Biological Cybernetics · doi:10.1007/bf00318719 · Cited by 35
Landscape statistics of the low-autocorrelation binary string problem
Ferreira, F. F., Fontanari, J. F., & Stadler, P. F. (2000) · Journal of Physics A Mathematical and General · doi:10.1088/0305-4470/33/48/304 · Cited by 28
A Note on Low Autocorrelation Binary Sequences
Dotú, I., & Hentenryck, P. V. (2006) · Lecture notes in computer science · doi:10.1007/11889205_51 · Cited by 24
Brglez, F., Li, X. Y., Stallmann, M. F. M., et al. (2003) · Cited by 23
A memetic algorithm for the low autocorrelation binary sequence problem
Gallardo, J. E., Cotta, C., & Fernández, A. J. (2007) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/1276958.1277195 · Cited by 22
Self-citationA statistical mechanics analysis of the set covering problem
Fontanari, J. F. (1996) · Journal of Physics A Mathematical and General · doi:10.1088/0305-4470/29/3/004 · Cited by 15
Metastable states in short-ranged p -spin glasses
de Oliveira, V. M., Fontanari, J. F., & Stadler, P. F. (1999) · Journal of Physics A Mathematical and General · doi:10.1088/0305-4470/32/50/302 · Cited by 13
Pearson, J., Ågren, M. S., & Bohlin, M. (2004) · Cited by 3
Flagged first, then by citations
Research works printed but not linked: 2
- A. Reinholz, Ein paralleler genetischer algorithmus zur optimierung der binarien autokorrelations-funktion, Diploma Thesis. Universität Bonn, October 1993.
- Beenker, 1985, Binary sequences with a maximally flat amplitude spectrum, Philips Journal of Research, 40, 289
Cited by
Sorted by citations
Shaydulin, R., Li, C., Chakrabarti, S., DeCross, M., Herman, D., Kumar, N., Larson, J., Lykov, D., Minssen, P., Sun, Y., et al. (2024) · Science Advances · doi:10.1126/sciadv.adm6761 · Cited by 120
“In particular, it may be possible to quadratically accelerate the best-known classical heuristic (Memetic Tabu (23)) by applying ideas similar to those used in quantum simulated annealing (5, 24, 25).”
MethodBošković, B., Brglez, F., & Brest, J. (2017) · Applied Soft Computing · doi:10.1016/j.asoc.2017.02.024 · Cited by 31
Metadata
- Authors
- Gallardo, J. E., Cotta, C., & Fernández, A. J.
- Affiliations
- Universidad de Málaga (ES)
- Corresponding author
- Gallardo, José E.
- Venue
- Applied Soft Computing
- Publisher
- Elsevier BV
- Published
- 2009-09
- Volume
- 9
- Issue
- 4
- Pages
- 1252-1262
- ISSN
- 1568-4946 (ISSN-L)
- OpenAlex
- W2137545253
- Cited by
- 59
- References
- 29
- Citations by year
- 2026: 1 · 2025: 4 · 2024: 6 · 2023: 2 · 2022: 5 · 2021: 3 · 2020: 4 · 2019: 4 · 2018: 3 · 2017: 6 · 2016: 7 · 2015: 2 · 2014: 7 · 2013: 2
- FWCI
- 1.08
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- Applied Soft Computing (publishedVersion)
- Funders
- Ministerio de Ciencia e Innovación
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Metaheuristic Optimization Algorithms Research
- Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Coding theory and cryptography
- Physical Sciences › Computer Science › Artificial Intelligence › Evolutionary Algorithms and Applications
- Keywords
- low autocorrelation binary sequences, hybrid genetic algorithm, tabu search, local search strategy, metaheuristic optimization, sequence construction
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
