Rosalind Problems

Bioinformatics Stronghold

1. Counting DNA Nucleotides
2. Transcribing DNA into RNA
3. Complementing a Strand of DNA
4. Rabbits and Recurrence Relations
5. Computing GC Content
6. Counting Point Mutations
7. Mendel’s First Law
8. Translating RNA into Protein
9. Finding a Motif in DNA
10. Mortal Fibonacci Rabbits
11. Calculating Expected Offspring
12. Independent Alleles
13. Enumerating Gene Orders
14. Consensus and Profile
15. Overlap Graphs
16. Finding a Shared Motif
17. Finding a Protein Motif
18. Inferring mRNA from Protein
19. Open Reading Frames
20. Calculating Protein Mass
21. Locating Restriction Sites
22. RNA Splicing
23. Enumerating k-mers Lexicographically
24. Longest Increasing Subsequence
25. Genome Assembly as Shortest Superstring
26. Perfect Matchings and RNA Secondary Structures
27. Partial Permutations
28. Introduction to Random Strings
29. Enumerating Oriented Gene Orderings
30. Finding a Spliced Motif
31. Transitions and Transversions
32. Completing a Tree
33. Catalan Numbers and RNA Secondary Structures
34. Error Correction in Reads
35. Counting Phylogenetic Ancestors
36. k-Mer Composition
37. Speeding Up Motif Finding
38. Finding a Shared Spliced Motif
39. Ordering Strings of Varying Length Lexicographically
40. Maximum Matchings and RNA Secondary Structures
41. Creating a Distance Matrix
42. Reversal Distance
43. Matching Random Motifs
44. Counting Subsets
45. Introduction to Alternative Splicing
46. Edit Distance
47. Expected Number of Restriction Sites
48. Motzkin Numbers and RNA Secondary Structures
49. Distances in Trees
50. Interleaving Two Motifs
51. Introduction to Set Operations
52. Sorting by Reversals
53. Inferring Protein from Spectrum
54. Introduction to Pattern Matching
55. Comparing Spectra with the Spectral Convolution
56. Creating a Character Table
57. Constructing a De Bruijn Graph
58. Edit Distance Alignment
59. Inferring Peptide from Full Spectrum
60. Independent Segregation of Chromosomes
61. Finding Disjoint Motifs in a Gene
62. Finding the Longest Multiple Repeat
63. Newick Format with Edge Weights
64. Wobble Bonding and RNA Secondary Structures
65. Counting Disease Carriers
66. Creating a Character Table from Genetic Strings
67. Counting Optimal Alignments
68. Counting Unrooted Binary Trees
69. Global Alignment with Scoring Matrix
70. Genome Assembly with Perfect Coverage
71. Matching a Spectrum to a Protein
72. Quartets
73. Using the Spectrum Graph to Infer Peptides
74. Encoding Suffix Trees
75. Character-Based Phylogeny
76. Counting Quartets
77. Enumerating Unrooted Binary Trees
78. Genome Assembly Using Reads
79. Global Alignment with Constant Gap Penalty
80. Linguistic Complexity of a Genome
81. Local Alignment with Scoring Matrix
82. Inferring Genotype from a Pedigree
83. Maximizing the Gap Symbols of an Optimal Alignment
84. Identifying Maximal Repeats
85. Multiple Alignment
86. Creating a Restriction Map
87. Counting Rooted Binary Trees
88. Sex-Linked Inheritance
89. Phylogeny Comparison with Split Distance
90. The Wright-Fisher Model of Genetic Drift
91. Alignment-Based Phylogeny
92. Assessing Assembly Quality with N50 and N75
93. Fixing an Inconsistent Character Set
94. Wright-Fisher’s Expected Behavior
95. The Founder Effect and Genetic Drift
96. Global Alignment with Scoring Matrix and Affine Gap Penalty
97. Genome Assembly with Perfect Coverage and Repeats
98. Overlap Alignment
99. Quartet Distance
100. Finding a Motif with Modifications
101. Semiglobal Alignment
102. Finding All Similar Motifs
103. Local Alignment with Affine Gap Penalty
104. Isolating Symbols in Alignments
105. Identifying Reversing Substitutions