Swiftly computing center strings

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

Volumn 6293 LNBI, Issue , 2010, Pages 325-336

  Hufsky, Franziska ^a,c   Kuchenbecker, Léon ^b   Jahn, Katharina ^b   Stoye, Jens ^b   Böcker, Sebastian ^a  

^a FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

^b BIELEFELD UNIVERSITY   (Germany)

^c International Max Planck Research School   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

A-CENTER; BIOLOGICAL APPLICATIONS; CLOSEST STRING; COMPUTATIONAL BIOLOGY; COMPUTING CENTER; EVALUATION STUDY; EXACT METHODS; INPUT STRING; NP COMPLETE; REDUCTION TECHNIQUES; SEARCH TREES;

DATA REDUCTION; HAMMING DISTANCE; STATISTICS; BIOINFORMATICS;

BIOINFORMATICS; HAMMING DISTANCE;

EID: 78049466720     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15294-8_27     Document Type: Conference Paper

References (11)

1. Böcker, S., Jahn, K., Mixtacki, J., Stoye, J.: Computation of median gene clusters. J. Comput. Biol. 16(8), 1085-1099 (2009)
2. Davila, J., Balla, S., Rajasekaran, S.: Fast and practical algorithms for planted (l, d) motif search. IEEE/ACM Trans. Comput. Biol. Bioinformatics 4(4), 544-552 (2007)
3. Frances, M., Litman, A.: On covering problems of codes. Theory Comput. Systems 30(2), 113-119 (1997)
4. Gramm, J., Niedermeier, R., Rossmanith, P.: Fixed-parameter algorithms for closest string and related problems. Algorithmica 37(1), 25-42 (2003)
5. Lanctot, J.K., Li, M., Ma, B., Wang, S., Zhang, L.: Distinguishing string selection problems. Information and Computation 185(1), 41-55 (2003)
6. Liu, X., He, H., Sykora, 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)
7. Ma, B., Sun, X.: More efficient algorithms for closest string and substring problems. SIAM J. Comput. 39(4), 1432-1443 (2009)
8. Rahmann, S., Klau, G.W.: Integer linear programming techniques for discovering approximate gene clusters. In: Mandoiu, I., Zelikovsky, A. (eds.) Bioinformatics Algorithms: Techniques and Applications. Wiley Series on Bioinformatics: Computational Techniques and Engineering, ch. 9, pp. 203-222. Wiley, Chichester (2008)
9. Wang, L., Zhu, B.: Efficient algorithms for the closest string and distinguishing string selection problems. In: Deng, X., Hopcroft, J.E., Xue, J. (eds.) FAW 2009. LNCS, vol. 5598, pp. 261-270. Springer, Heidelberg (2009)
10. Wang, Y., Chen, W., Li, X., Cheng, B.: Degenerated primer design to amplify the heavy chain variable region from immunoglobulin cdna. BMC Bioinformatics 7(suppl. 4), S9 (2006)
11. Yanai, I., DeLisi, C.: The society of genes: networks of functional links between genes from comparative genomics. Genome Biol. 3(11), research0064 (2002)