A Genetic Approximation of Closest String via Rank Distance

被引：2
|
作者：
Dinu, Liviu P. [1 ]
Ionescu, Radu [1 ]
机构：
[1] Univ Bucharest, Fac Math & Comp Sci, Acad 14, RO-010014 Bucharest, Romania
来源：
13TH INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND NUMERIC ALGORITHMS FOR SCIENTIFIC COMPUTING (SYNASC 2011) | 2012年
关键词：
AGGREGATION;
D O I：
10.1109/SYNASC.2011.31
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
This paper aims to fully present a new genetic approach that uses rank distance for solving two known NP-complete problems: closest string and closest substring. We build a genetic algorithm for each of the two problems and we describe the genetic operations involved. The genetic algorithm adapted for the closest substring problem uses standard genetic operations, while the genetic operations for the closest string problem are only inspired from nature. Both genetic algorithms bring something new by using a fitness function based on rank distance. The tests for both problems show that our genetic approach via rank distance has good results.
引用
收藏
页码：207 / 214
页数：8
相关论文
共 50 条
  • [41] LOW-RANK APPROXIMATION OF MATRICES VIA A RANK-REVEALING FACTORIZATION WITH RANDOMIZATION
    Kaloorazi, Maboud Farzaneh
    Chen, Jie
    2020 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, 2020, : 5815 - 5819
  • [42] On the convergence of certain methods of closest approximation
    Carlson, Elizabeth
    TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 1926, 28 (1-4) : 435 - 447
  • [43] REGULARITY PROPERTIES OF ELEMENT OF CLOSEST APPROXIMATION
    SHAPIRO, HS
    TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 1973, 181 (JUL) : 127 - 142
  • [44] On the Closest Vector Problem with a Distance Guarantee
    Dadush, Daniel
    Regev, Oded
    Stephens-Davidowitz, Noah
    2014 IEEE 29TH CONFERENCE ON COMPUTATIONAL COMPLEXITY (CCC), 2014, : 98 - 109
  • [45] CONSTANT MODULUS BEAMFORMING VIA LOW-RANK APPROXIMATION
    Adler, Amir
    Wax, Mati
    2018 IEEE STATISTICAL SIGNAL PROCESSING WORKSHOP (SSP), 2018, : 776 - 780
  • [46] Constant modulus algorithms via low-rank approximation
    Adler, Amir
    Wax, Mati
    SIGNAL PROCESSING, 2019, 160 : 263 - 270
  • [47] Tensor Recovery via Nonconvex Low-Rank Approximation
    Chen, Lin
    Jiang, Xue
    Liu, Xingzhao
    Zhou, Zhixin
    28TH EUROPEAN SIGNAL PROCESSING CONFERENCE (EUSIPCO 2020), 2021, : 710 - 714
  • [48] Low-rank approximation of tensors via sparse optimization
    Wang, Xiaofei
    Navasca, Carmeliza
    NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS, 2018, 25 (02)
  • [49] A Low-Rank Approximation for MDPs via Moment Coupling
    Zhang, Amy B. Z.
    Gurvich, Itai
    OPERATIONS RESEARCH, 2024, 72 (03) : 1255 - 1277
  • [50] An approximation algorithm for approximation rank
    Lee, Troy
    Shraibman, Adi
    PROCEEDINGS OF THE 24TH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, 2009, : 351 - +
12345