Algorithm

Mathematical Algorithms

• Asymptotic Notation for Algorithm Costs
• Time Complexity and Space Complexity
• Dynamic Programming
  • Why to Be Careful When Using Recursive Functions
• Greedy Algorithms

Sorting Algorithms

• Time Complexity of Comparison Sorting Algorithms
• Lower Bound of Time Complexity for Comparison Sorting Algorithms
• Radix Sort
• Stalin Sort

String Processing

• Edit Distance of Strings
  • Levenshtein Algorithm
• N-Grams and Jaccard Coefficient
• Heap’s Law
• Zipf’s Law

Bioinformatics

• Central Dogma of Molecular Biology
• Prokaryotic and Eukaryotic Organisms in Bioinformatics
• DNA, RNA, and Chromosomes in Bioinformatics
  • Major Bases and Base Pairs in Bioinformatics
  • Introns and Exons in Bioinformatics
  • Genomes and Genes in Bioinformatics
• Base Sequences in Bioinformatics
  • Upstream and Downstream of Base Sequences
  • Codons and the Genetic Code of Amino Acids in Bioinformatics
• What is Sequence Alignment?
  • Sequence Alignment Scores and Gap Penalties
  • Substitution Matrices in Sequence Alignment
  • Needleman-Wunsch Algorithm: Global Sequence Alignment
  • Smith-Waterman Algorithm: Local Sequence Alignment

References

• 문병로. (2018). 쉽게 배우는 알고리즘: 관계 중심의 사고법
• Del C. Jones, Pavel A. Pevzner. (2009). An Introduction to Bioinformatics Algorithms (Computational Molecular Biology)