Subsequence combinatorics and applications to microarray production, DNA sequencing and chaining algorithms

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

Volumn 4009 LNCS, Issue , 2006, Pages 153-164

  Rahmann, Sven ^a  

^a BIELEFELD UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; DNA; INTEGER PROGRAMMING; OPTIMIZATION; SET THEORY;

COMBINATORIAL ENUMERATION PROBLEMS; DNA SEQUENCING; MICROARRAY PRODUCTION;

PROBLEM SOLVING;

EID: 33746095437     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11780441_15     Document Type: Conference Paper

References (6)

1. Margulies, M., et al.: Genome sequencing in microfabricated high-density picolitre reactors. Nature 437(7057) (2005) 376380 / Corrigendum in Nature 439(7075) (2006) p.502.
2. Aldous, D., Diaconis, P.: Longest increasing subsequences: From patience sorting to the Baik-Deift-Johansson theorem. Bulletin of the American Mathematical Society 36(4) (1999) 413432
3. Niedermeier, R.: Invitation to Fixed Parameter Algorithms. Oxford University Press (2006)
4. Rahmann, S.: The shortest common supersequence problem in a microarray production setting. In: Proceedings of the 2nd European Conference in Computational Biology (ECCB 2003). Volume 19 Suppl. 2 of Bioinformatics. (2003) ii156ii161
5. Chase, P.: Subsequence numbers and logarithmic concavity. Discrete Math. 16 (1976) 123140
6. Skiena, S.S.: The Algorithm Design Manual. Springer (1997)