A genetic approximation of closest string via rank distance

Proceedings - 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2011

Volumn , Issue , 2011, Pages 207-214

  Dinu, Liviu P ^a   Ionescu, Radu ^a  

^a UNIVERSITY OF BUCHAREST   (Romania)

Author keywords

closest string; genetic algorithm; rank distance

Indexed keywords

COMPUTATIONAL COMPLEXITY;

CLOSEST STRING; CLOSEST STRING PROBLEM; FITNESS FUNCTIONS; GENETIC APPROACH; GENETIC OPERATIONS; RANK DISTANCE; SUB-STRINGS;

GENETIC ALGORITHMS;

EID: 84860379607     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SYNASC.2011.31     Document Type: Conference Paper

References (34)

1. Banzhaf, Wolfgang; Nordin, Peter; Keller, Robert; Francone, Frank (1998). Genetic Programming - An Introduction, Morgan Kaufmann, San Francisco, CA.
2. A. Ben-Dor, G. Lancia, J. Perone, and R. Ravi. Banishing Bias from Consensus Sequences. Proceedings of 8th Symposium on Combinatorial Pattern Matching, Lecture in Computer Science, 1264 (1997) 247-261.
3. X. Deng, G. Li, Z. Li, B. Ma, and L. Wang. Genetic Design of Drugs without Side-Effects. SIAM Journal on Computing, 32 (2003) 1073-1090.
4. Crosby, Jack L. (1973). Computer Simulation in Genetics. London: John Wiley & Sons.
5. P. Diaconis, R. L. Graham, Spearman footrule as a Measure of Disarray, Journal of Royal Statistical Society. Series B (Methodological), 39(2), 262-268, 1977.
6. L. P. Dinu. On the classification and aggregation of hierarchies with different constitutive elements, Fundamenta Informaticae, 55(1), 39-50, 2003.
7. L. P. Dinu and F. Manea. An Efficient Approach for the Rank Aggregation Problem. Theoretical Computer Science, vol. 359 (1-3), pp. 455-461, 2006
8. L. P. Dinu, A. Sgarro. A Low-complexity Distance for DNA Strings. Fundamenta Informaticae, 73(3), 361-372, 2006 (Pubitemid 44608572)
9. L. P. Dinu, A. Popa. On the closest string via rank distance(submitted)
10. M. Frances, A. Litman. On Covering Problems of Codes. Theory Comput. Syst. 30(2): 113-119 (1997).
11. Fraser, Alex S. (1957). "Simulation of Genetic Systems by Automatic Digital Computers. I. Introduction". Australian Journal of Biological Sciences 10: 484-491.
12. Fraser, Alex S.; Burnell, Donald (1970). Computer Models in Genetics. New York: McGraw-Hill.
13. Goldberg, David E. (1989). Genetic Algorithms in Search, Optimization and Machine Learning, Kluwer Academic Publishers, Boston, MA.
14. J. Gramm, F. Huffner, and R. Niedermeier. Closest Strings, Primer Design, and Motif Search. Currents in Computational Molecular Biology, poster abstracts of RECOMB 2002, pp. 74-75, 2002.
15. C. de la Higuera, F. Casacuberta, Topology of strings: Median string is NP-complete, Theor. Comp. Sci., 230, 39-48, 2000.
16. M. Karpovsky. Weight Distribution of Translates, Covering Radius and Perfect Codes. IEEE Trans. Inform. Theory, vol. IT-27, pp. 462-472, 1981.
17. E. V. Koonin. The emerging paradigm and open problems in comparative genomics. Bioinformatics, 15, 265-266, 1999
18. F. Nicolas, E. Rivals, Hardness Results for the Center and Median String Problems under the Weighted and Unweighted Edit Distances, J. of Discrete Algorithms, 3(2-4), 390-415, 2005. (Pubitemid 40655188)
19. K. Lanctot, M. Li, B. Ma, S. Wang, and L. Zhang. Distinguishing String Selection Problems. Information and Computation, 185 (2003) 41-55.
20. A preliminary version appeared in Proceed- ings of 10th ACM-SIAM Symposium on Discrete Algorithms, pp. 633-642, 2003.
21. M. Li, X. Chen, X. Li, B. Ma, and Paul M.B. Vitanyi. The Similarity Metric. IEEE Transaction on Information Theory, 50:12(2004), 3250- 3264, 2004.
22. M. Li, B. Ma, and L.Wang. Finding Similar Regions in Many Sequences. J. Comput. Syst. Sci., 65 (2002) 111-132.
23. A preliminary version appeared in Proceedings of the 31st ACM Symposium on Theory of Computing, pp. 473-482, 1999.
24. X. Liu, H. He, and O. Skora. Parallel genetic algorithm and parallel simulated annealing algorithm for the closest string problem. In Proc. ADMA 2005, volume 3584 of LNCS, pages 591597. Springer, 2005.
25. A.W-C. Liew, H. Yan, M. Yang. Pattern recognition techniques for the emerging field of bioinformatics: A review Pattern Recognition, 38 (2005), 2055-2073 (Pubitemid 41214645)
26. F. Nicolas, E. Rivals, Complexities of centre and median string, LNCS, 2676, 315 - 327, 2003.
27. J. Palmer, L. Herbon, Plant mitochondrial DNA evolves rapidly in structure, but slowly in sequence, Journal of Molecular Evolution, 28 (1988) 87-89.
28. V. Yu. Popov. Multiple genome rearrangement by swaps and by element duplications. Theoretical Computer Science, 385(1-3):115-126, 2007
29. S. Roman 1992. Coding and Information Theory. Volume 134 of Graduate Texts in Mathematics. Springer-Verlag, Heidelberg, Germany.
30. T.F. Smith and M.S. Waterman. Identification of Common Molecular Subsequences. Journal of Molecular Biology 147: 195197, 1981.
31. Schmitt, Lothar M. (2001). Theory of Genetic Algorithms, Theoretical Computer Science 259: 1-61
32. D. J. States and P. Agarwal. Compact encoding strategies for DNA sequence similarity search. In Proceedings of the Fourth International Conference on Intelligent Systems for Molecular Biology, pages 211-217. AAAI Press, 1996.
33. L. Wang and L. Dong. Randomized Algorithms for Motif Detection. Journal of Bioinformatics and Computational Biology, 3 (2005) 1038- 1052.
34. J. C. Wooley. Trends in computational biology: a summary based on a RECOMB plenary lecture. J. Comput. Biology, 6, 459-474, 1999