On the closest string via rank distance

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7354 LNCS, Issue , 2012, Pages 413-426

  Dinu, Liviu P ^a   Popa, Alexandru ^b  

^a UNIVERSITY OF BUCHAREST   (Romania)

^b AALTO UNIVERSITY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

CLOSEST STRING; CLOSEST STRING PROBLEMS; CLOSEST SUBSTRING PROBLEMS; DISTANCE MEASURE; EDIT DISTANCE; INPUT STRING; K-APPROXIMATION ALGORITHM; NP-HARD; POLYNOMIAL-TIME; RANK DISTANCE; SUBSTRING;

APPROXIMATION ALGORITHMS; BIOINFORMATICS; PATTERN MATCHING; POLYNOMIAL APPROXIMATION;

HAMMING DISTANCE;

EID: 84861902988     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-31265-6_33     Document Type: Conference Paper

References (21)

1. Arrow, K.J.: Social Choice and Indivudual Values. Wiley, New York (1963)
2. Ben-Dor, A., Lancia, G., Perone, J., Ravi, R.: Banishing Bias from Consensus Sequences. In: Hein, J., Apostolico, A. (eds.) CPM 1997. LNCS, vol. 1264, pp. 247-261. Springer, Heidelberg (1997)
3. Berstein, Y., Onn, S.: Nonlinear bipartite matching. Disc. Optim. 5(1), 53-65 (2008)
4. de la Higuera, C., Casacuberta, F.: Topology of Strings: Median String is NP-Complete. Theor. Comput. Sci. 230(1-2), 39-48 (2000)
5. Deng, X., Li, G., Li, Z., Ma, B., Wang, L.: Genetic design of drugs without side-effects. SIAM J. Comput. 32(4), 1073-1090 (2003)
6. Diaconis, P., Graham, R.L.: Spearman's footrule as a measure of disarray. J. Royal Statist. Soc. Series B (Methodological) 39(2), 262-268 (1977)
7. Dinu, L.P.: On the classification and aggregation of hierarchies with different constitutive elements. Fundam. Inform. 55(1), 39-50 (2003)
8. Dinu, L.P., Manea, F.: An efficient approach for the rank aggregation problem. Theor. Comput. Sci. 359(1-3), 455-461 (2006)
9. Dinu, L.P., Sgarro, A.: A low-complexity distance for dna strings. Fundam. Inform. 73(3), 361-372 (2006)
10. Frances, M., Litman, A.: On covering problems of codes. Theory Comput. Syst. 30(2), 113-119 (1997)
11. Gramm, J., Huffner, F., Niedermeier, R.: Closest strings, primer design, and motif search. currents in computational molecular biology. In: RECOMB, pp. 74-75 (2002)
12. Lanctot, J.K., Li, M., Ma, B., Wang, S., Zhang, L.: Distinguishing string selection problems. Inf. Comput. 185(1), 41-55 (2003)
13. Li, M., Ma, B., Wang, L.: Finding similar regions in many sequences. J. Comput. Syst. Sci. 65(1), 73-96 (2002)
14. Liu, X., He, H., Sýkora, O.: Parallel Genetic Algorithm and Parallel Simulated Annealing Algorithm for the Closest String Problem. In: Li, X., Wang, S., Dong, Z.Y. (eds.) ADMA 2005. LNCS (LNAI), vol. 3584, pp. 591-597. Springer, Heidelberg (2005)
15. Nicolas, F., Rivals, E.: Complexities of the Centre and Median String Problems. In: Baeza-Yates, R., Chávez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol. 2676, pp. 315-327. Springer, Heidelberg (2003)
16. Nicolas, F., Rivals, E.: Hardness results for the center and median string problems under the weighted and unweighted edit distances. J. Disc. Alg. 3(2-4), 390-415 (2005)
17. Palmer, J., Herbon, L.: Plant mitochondrial dna evolves rapidly in structure, but slowly in sequence. J. Mol. Evol. 28, 87-89 (1988)
18. Popov, V.Y.: Multiple genome rearrangement by swaps and by element duplications. Theor. Comput. Sci. 385(1-3), 115-126 (2007)
19. Schwarz, N.: Rank aggregation by criteria. Minimizing the maximum Kendall-tau distance. Diplomarbeit, Jena (2009)
20. Wang, L., Dong, L.: Randomized algorithms for motif detection. J. Bioinf. and Comp. Biol. 3(5), 1039-1052 (2005)
21. Wooley, J.C.: Trends in computational biology: A summary based on a recomb plenary lecture. J. Comp. Biol. 6(3/4) (1999)