- Analysis of Algorithms Max Alekseyev
- Analysis of Algorithms Max Alekseyev
- Colored de Bruijn Graphs and the Genome Halving Problem
- Analysis of Algorithms Max Alekseyev
- Analysis of Algorithms Max Alekseyev
- Analysis of Algorithms Max Alekseyev
- Analysis of Algorithms Max Alekseyev
- Introduction to Bioinformatics
- Analysis of Algorithms Max Alekseyev
- Analysis of Algorithms Max Alekseyev
- Analysis of Algorithms Max Alekseyev
- Limited Lifespan of Fragile Regions in Mammalian Evolution
- CSCE551: Topics for MidTerm 1 1. Definition and state diagram notation of DFA, NFA, GNFA, PDA as well as computations
- Multi-break Rearrangements: From Circular to Linear Genomes
- Theoretical Computer Science 395 (2008) 193202 www.elsevier.com/locate/tcs
- Journal of Mathematical Sciences, Vol. 107, No. 5, 2001 ON APPROXIMATION OF GROUPS, GROUP ACTIONS, AND
- Whole Genome Duplications, Multi-Break Rearrangements, and Genome Halving Problem
- JOURNAL OF COMPUTATIONAL BIOLOGY Volume 15, Number 8, 2008
- Analysis of Algorithms Max Alekseyev
- www.bioalgorithms.infoAn Introduction to Bioinformatics Algorithms Protein Sequencing and
- Analysis of Algorithms Max Alekseyev
- Decoding Synteny Blocks and Large-Scale Duplications in Mammalian and Plant Genomes
- PROBLEMS AND SOLUTIONS Edited by Gerald A. Edgar, Doug Hensley, Douglas B. West
- PROBLEMS AND SOLUTIONS Edited by Gerald A. Edgar, Doug Hensley, Douglas B. West
- Genome Halving Problem Revisited Max A. Alekseyev and Pavel A. Pevzner
- Introduction to Bioinformatics
- Analysis of Algorithms Dr. Max Alekseyev
- Analysis of Algorithms Max Alekseyev
- Analysis of Algorithms Max Alekseyev
- Analysis of Algorithms Max Alekseyev
- Analysis of Algorithms Max Alekseyev
- Analysis of Algorithms Max Alekseyev
- Analysis of Algorithms Max Alekseyev
- Analysis of Algorithms Max Alekseyev
- Analysis of Algorithms Max Alekseyev
- Analysis of Algorithms Max Alekseyev
- Analysis of Algorithms Max Alekseyev
- CSCE750: Topics for Midterm 1. Asymptotic notation: O(), (), (), o(), (); summation and product techniques.
- PROBLEMS AND SOLUTIONS Edited by Gerald A. Edgar, Doug Hensley, Douglas B. West
- COMMUNICATIONS IN INFORMATION AND SYSTEMS c 2010 International Press Vol. 10, No. 1, pp. 1-22, 2010 001
- Breakpoint Graphs and Ancestral Genome Reconstructions Max A. Alekseyev and Pavel A. Pevzner
- SIAM J. COMPUT. c 2007 Society for Industrial and Applied Mathematics Vol. 36, No. 6, pp. 17481763
- CSCE 590: Bioinformatics Algorithms Catalog Course Description
- Theory of Computation Lecture 9: Non-context-free Languages
- Theory of Computation Lecture 11: Algorithms
- CSCE551: Theory of Computation Lecture 1: Introduction
- Theory of Computation Lecture 13: Undecidable Languages
- Theory of Computation Lecture 14: Reducibility
- Theory of Computation Lecture 8: Pushdown Automata
- Theory of Computation Lecture 5: Regular Expressions
- Theory of Computation Lecture 6: Nonregular Languages
- Theory of Computation Lecture 3: Finite Automata
- Theory of Computation Lecture 4: Nondeterministic Finite Automata
- Theory of Computation Lecture 10: Turning Machines
- Theory of Computation Lecture 2: Mathematical Background
- Theory of Computation Lecture 7: Context-free Grammar
- Theory of Computation Lecture 12: Decidable Languages
