Rosalind Bioinformatics Stronghold

🚀 Solutions for the Bioinformatics Stronghold Problems from Rosalind

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