rosalind-solutions

KO | EN

gitlite — search

#hacktoberfest #ai #go #machine-learning #rust #deep-learning #linux #java #windows #kubernetes #security #ios #mcp #open-source

rosalind-solutions

(★ 111)

my solutions to problems from Rosalind.

rosalind-solutions 최신버젼 다운로드

최종 버전 다운로드 (.zip)

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

# Rosalind solutions

> **ROSALIND** is a platform for learning bioinformatics and programming through problem solving. 
> Here are my solutions. 
> Please :star: this repo if it helps you:heart:!

**website:** [http://rosalind.info](http://rosalind.info)

**my account:** http://rosalind.info/users/huihui0228

**problems & solutions:**

* 2SAT: 2-Satisfiability [[info](http://rosalind.info/problems/2sat/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_2sat.py)]
* 2SUM: 2SUM [[info](http://rosalind.info/problems/2sum/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_2sum.py)]
* 3SUM: 3SUM [[info](http://rosalind.info/problems/3sum/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_3sum.py)]
* AFRQ: Counting Disease Carriers [[info](http://rosalind.info/problems/afrq/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_afrq.py)]
* ASPC: Introduction to Alternative Splicing [[info](http://rosalind.info/problems/aspc/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_aspc.py)]
* BA1A: Compute the Number of Times a Pattern Appears in a Text [[info](http://rosalind.info/problems/ba1a/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_ba1a.py)]
* BA1B: Find the Most Frequent Words in a String [[info](http://rosalind.info/problems/ba1b/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_ba1b.py)]
* BA1C: Find the Reverse Complement of a String [[info](http://rosalind.info/problems/ba1c/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_ba1c.py)]
* BA1D: Find All Occurrences of a Pattern in a String [[info](http://rosalind.info/problems/ba1d/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_ba1d.py)]
* BA1E: Find Patterns Forming Clumps in a String [[info](http://rosalind.info/problems/ba1e/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_ba1e.py)]
* BA1F: Find a Position in a Genome Minimizing the Skew [[info](http://rosalind.info/problems/ba1f/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_ba1f.py)]
* BA1G: Compute the Hamming Distance Between Two Strings [[info](http://rosalind.info/problems/ba1g/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_ba1g.py)]
* BA1H: Find All Approximate Occurrences of a Pattern in a String [[info](http://rosalind.info/problems/ba1h/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_ba1h.py)]
* BA1I: Find the Most Frequent Words with Mismatches in a String [[info](http://rosalind.info/problems/ba1i/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_ba1i.py)]
* BA1J: Find Frequent Words with Mismatches and Reverse Complements [[info](http://rosalind.info/problems/ba1j/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_ba1j.py)]
* BA1K: Generate the Frequency Array of a String [[info](http://rosalind.info/problems/ba1k/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_ba1k.py)]
* BA1L: Implement PatternToNumber [[info](http://rosalind.info/problems/ba1l/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_ba1l.py)]
* BA1M: Implement NumberToPattern [[info](http://rosalind.info/problems/ba1m/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_ba1m.py)]
* BA1N: Generate the d-Neighborhood of a String [[info](http://rosalind.info/problems/ba1n/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_ba1n.py)]
* BA2A: Implement MotifEnumeration [[info](http://rosalind.info/problems/ba2a/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_ba2a.py)]
* BA2B: Find a Median String [[info](http://rosalind.info/problems/ba2b/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_ba2b.py)]
* BA2C: Find a Profile-most Probable k-mer in a String [[info](http://rosalind.info/problems/ba2c/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_ba2c.py)]
* BA2D: Implement GreedyMotifSearch [[info](http://rosalind.info/problems/ba2d/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_ba2d.py)]
* BA2H: Implement DistanceBetweenPatternAndStrings [[info](http://rosalind.info/problems/ba2h/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_ba2h.py)]
* BA3A: Generate the k-mer Composition of a String [[info](http://rosalind.info/problems/ba3a/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_ba3a.py)]
* BA3B: Reconstruct a String from its Genome Path [[info](http://rosalind.info/problems/ba3b/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_ba3b.py)]
* BA3C: Construct the Overlap Graph of a Collection of k-mers [[info](http://rosalind.info/problems/ba3c/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_ba3c.py)]
* BA3D: Construct the De Bruijn Graph of a String [[info](http://rosalind.info/problems/ba3d/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_ba3d.py)]
* BA3E: Construct the De Bruijn Graph of a Collection of k-mers [[info](http://rosalind.info/problems/ba3e/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_ba3e.py)]
* BA5A: Find the Minimum Number of Coins Needed to Make Change [[info](http://rosalind.info/problems/ba5a/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_ba5a.py)]
* BA5B: Find the Length of a Longest Path in a Manhattan-like Grid [[info](http://rosalind.info/problems/ba5b/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_ba5b.py)]
* BA5C: Find a Longest Common Subsequence of Two Strings [[info](http://rosalind.info/problems/ba5c/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_ba5c.py)]
* BA10A: Compute the Probability of a Hidden Path [[info](http://rosalind.info/problems/ba10a/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_ba10a.py)]
* BA10B: Compute the Probability of an Outcome Given a Hidden Path [[info](http://rosalind.info/problems/ba10b/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_ba10b.py)]
* BF: Bellman-Ford Algorithm [[info](http://rosalind.info/problems/bf/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_bf.py)]
* BFIL: Base Filtration by Quality [[info](http://rosalind.info/problems/bfil/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_bfil.py)]
* BFS: Breadth-First Search [[info](http://rosalind.info/problems/bfs/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_bfs.py)]
* BIP: Testing Bipartiteness [[info](http://rosalind.info/problems/bip/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_bip.py)]
* BPHR: Base Quality Distribution [[info](http://rosalind.info/problems/bphr/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_bphr.py)]
* CAT: Catalan Numbers and RNA Secondary Structures [[info](http://rosalind.info/problems/cat/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_cat.py)]
* CC: Connected Components [[info](http://rosalind.info/problems/cc/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_cc.py)]
* CLUS: Global Multiple Alignment [[info](http://rosalind.info/problems/clus/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_clus.py)]
* CONS: Consensus and Profile [[info](http://rosalind.info/problems/cons/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_cons.py)]
* CONV: Comparing Spectra with the Spectral Convolution [[info](http://rosalind.info/problems/conv/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_conv.py)]
* CORR: Error Correction in Reads [[info](http://rosalind.info/problems/corr/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_corr.py)]
* CTE: Shortest Cycle Through a Given Edge [[info](http://rosalind.info/problems/cte/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_cte.py)]
* DAG: Testing Acyclicity [[info](http://rosalind.info/problems/dag/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_dag.py)]
* DBPR: Introduction to Protein Databases [[info](http://rosalind.info/problems/dbpr/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_dbpr.py)]
* DDEG: Double-Degree Array [[info](http://rosalind.info/problems/ddeg/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_ddeg.py)]
* DEG: Degree Array [[info](http://rosalind.info/problems/deg/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_deg.py)]
* DIJ: Dijkstra's Algorithm [[info](http://rosalind.info/problems/dij/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_dij.py)]
* DNA: Counting DNA Nucleotides [[info](http://rosalind.info/problems/dna/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_dna.py)]
* EDIT: Edit Distance [[info](http://rosalind.info/problems/edit/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_edit.py)]
* EDTA: Edit Distance Alignment [[info](http://rosalind.info/problems/edta/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_edta.py)]
* EVAL: Expected Number of Restriction Sites [[info](http://rosalind.info/problems/eval/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_eval.py)]
* FIB: Rabbits and Recurrence Relations [[info](http://rosalind.info/problems/fib/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_fib.py)]
* FIBD: Mortal Fibonacci Rabbits [[info](http://rosalind.info/problems/fibd/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_fibd.py)]
* FIBO: Fibonacci Numbers [[info](http://rosalind.info/problems/fibo/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_fibo.py)]
* FILT: Read Filtration by Quality [[info](http://rosalind.info/problems/filt/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_filt.py)]
* FOUN: The Founder Effect and Genetic Drift [[info](http://rosalind.info/problems/foun/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_foun.py)]
* FRMT: Data Formats [[info](http://rosalind.info/problems/frmt/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_frmt.py)]
* FULL: Inferring Peptide from Full Spectrum [[info](http://rosalind.info/problems/full/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_full.py)]
* GBK: GenBank Introduction [[info](http://rosalind.info/problems/gbk/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_gbk.py)]
* GC: Computing GC Content [[info](http://rosalind.info/problems/gc/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_gc.py)]
* GRPH: Overlap Graphs [[info](http://rosalind.info/problems/grph/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_grph.py)]
* GS: General Sink [[info](http://rosalind.info/problems/gs/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_gs.py)]
* HAMM: Counting Point Mutations [[info](http://rosalind.info/problems/hamm/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_hamm.py)]
* HDAG: Hamiltonian Path in DAG [[info](http://rosalind.info/problems/hdag/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_hdag.py)]
* HEA: Building a Heap [[info](http://rosalind.info/problems/hea/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_hea.py)]
* HS: Heap Sort [[info](http://rosalind.info/problems/hs/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_hs.py)]
* IEV: Calculating Expected Offspring [[info](http://rosalind.info/problems/iev/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_iev.py)]
* INDC: Independent Segregation of Chromosomes [[info](http://rosalind.info/problems/indc/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_indc.py)]
* INI: Introduction to the Bioinformatics Armory [[info](http://rosalind.info/problems/ini/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_ini.py)]
* INI1: Installing Python [[info](http://rosalind.info/problems/ini1/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_ini1.py)]
* INI2: Variables and Some Arithmetic [[info](http://rosalind.info/problems/ini2/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_ini2.py)]
* INI3: Strings and Lists [[info](http://rosalind.info/problems/ini3/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_ini3.py)]
* INI4: Conditions and Loops [[info](http://rosalind.info/problems/ini4/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_ini4.py)]
* INI5: Working with Files [[info](http://rosalind.info/problems/ini5/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_ini5.py)]
* INI6: Dictionaries [[info](http://rosalind.info/problems/ini6/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_ini6.py)]
* INOD: Counting Phylogenetic Ancestors [[info](http://rosalind.info/problems/inod/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_inod.py)]
* INS: Insertion Sort [[info](http://rosalind.info/problems/ins/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_ins.py)]
* INV: Counting Inversions [[info](http://rosalind.info/problems/inv/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_inv.py)]
* IPRB: Mendel's First Law [[info](http://rosalind.info/problems/iprb/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_iprb.py)]
* KMER: k-Mer Composition [[info](http://rosalind.info/problems/kmer/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_kmer.py)]
* KMP: Speeding Up Motif Finding [[info](http://rosalind.info/problems/kmp/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_kmp.py)]
* LCSM: Finding a Shared Motif [[info](http://rosalind.info/problems/lcsm/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_lcsm.py)]
* LCSQ: Finding a Shared Spliced Motif [[info](http://rosalind.info/problems/lcsq/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_lcsq.py)]
* LEXF: Enumerating k-mers Lexicographically [[info](http://rosalind.info/problems/lexf/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_lexf.py)]
* LEXV: Ordering Strings of Varying Length Lexicographically [[info](http://rosalind.info/problems/lexv/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_lexv.py)]
* LGIS: Longest Increasing Subsequence [[info](http://rosalind.info/problems/lgis/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_lgis.py)]
* LIA: Independent Alleles [[info](http://rosalind.info/problems/lia/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_lia.py)]
* LONG: Genome Assembly as Shortest Superstring [[info](http://rosalind.info/problems/long/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_long.py)]
* MAJ: Majority Element [[info](http://rosalind.info/problems/maj/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_maj.py)]
* MED: Median [[info](http://rosalind.info/problems/med/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_med.py)]
* MEME: New Motif Discovery [[info](http://rosalind.info/problems/meme/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_meme.py)]
* MEND: Inferring Genotype from a Pedigree [[info](http://rosalind.info/problems/mend/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_mend.py)]
* MER: Merge Two Sorted Arrays [[info](http://rosalind.info/problems/mer/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_mer.py)]
* MMCH: Maximum Matchings and RNA Secondary Structures [[info](http://rosalind.info/problems/mmch/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_mmch.py)]
* MOTZ: Motzkin Numbers and RNA Secondary Structures [[info](http://rosalind.info/problems/motz/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_motz.py)]
* MPRT: Finding a Protein Motif [[info](http://rosalind.info/problems/mprt/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_mprt.py)]
* MRNA: Inferring mRNA from Protein [[info](http://rosalind.info/problems/mrna/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_mrna.py)]
* NEED: Pairwise Global Alignment [[info](http://rosalind.info/problems/need/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_need.py)]
* NWC: Negative Weight Cycle [[info](http://rosalind.info/problems/nwc/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_nwc.py)]
* NWCK: Distances in Trees [[info](http://rosalind.info/problems/nwck/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_nwck.py)]
* ORF: Open Reading Frames [[info](http://rosalind.info/problems/orf/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_orf.py)]
* ORFR: Finding Genes with ORFs [[info](http://rosalind.info/problems/orfr/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_orfr.py)]
* PAR: 2-Way Partition [[info](http://rosalind.info/problems/par/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_par.py)]
* PAR3: 3-Way Partition [[info](http://rosalind.info/problems/par3/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_par3.py)]
* PDST: Creating a Distance Matrix [[info](http://rosalind.info/problems/pdst/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_pdst.py)]
* PERM: Enumerating Gene Orders [[info](http://rosalind.info/problems/perm/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_perm.py)]
* PHRE: Read Quality Distribution [[info](http://rosalind.info/problems/phre/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_phre.py)]
* PMCH: Perfect Matchings and RNA Secondary Structures [[info](http://rosalind.info/problems/pmch/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_pmch.py)]
* PPER: Partial Permutations [[info](http://rosalind.info/problems/pper/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_pper.py)]
* PROB: Introduction to Random Strings [[info](http://rosalind.info/problems/prob/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_prob.py)]
* PROT: Translating RNA into Protein [[info](http://rosalind.info/problems/prot/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_prot.py)]
* PRSM: Matching a Spectrum to a Protein [[info](http://rosalind.info/problems/prsm/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_prsm.py)]
* PRTM: Calculating Protein Mass [[info](http://rosalind.info/problems/prtm/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_prtm.py)]
* PS: Partial Sort [[info](http://rosalind.info/problems/ps/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_ps.py)]
* PTRA: Protein Translation [[info](http://rosalind.info/problems/ptra/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_ptra.py)]
* QS: Quick Sort [[info](http://rosalind.info/problems/qs/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_qs.py)]
* REAR: Reversal Distance [[info](http://rosalind.info/problems/rear/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_rear.py)]
* REVC: Complementing a Strand of DNA [[info](http://rosalind.info/problems/revc/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_revc.py)]
* REVP: Locating Restriction Sites [[info](http://rosalind.info/problems/revp/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_revp.py)]
* RNA: Transcribing DNA into RNA [[info](http://rosalind.info/problems/rna/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_rna.py)]
* RNAS: Wobble Bonding and RNA Secondary Structures [[info](http://rosalind.info/problems/rnas/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_rnas.py)]
* RSTR: Matching Random Motifs [[info](http://rosalind.info/problems/rstr/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_rstr.py)]
* RVCO: Complementing a Strand of DNA [[info](http://rosalind.info/problems/rvco/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_rvco.py)]
* SC: Semi-Connected Graph [[info](http://rosalind.info/problems/sc/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_sc.py)]
* SCC: Strongly Connected Components [[info](http://rosalind.info/problems/scc/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_scc.py)]
* SCSP: Interleaving Two Motifs [[info](http://rosalind.info/problems/scsp/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_scsp.py)]
* SDAG: Shortest Paths in DAG [[info](http://rosalind.info/problems/sdag/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_sdag.py)]
* SETO: Introduction to Set Operations [[info](http://rosalind.info/problems/seto/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_seto.py)]
* SEXL: Sex-Linked Inheritance [[info](http://rosalind.info/problems/sexl/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_sexl.py)]
* SGRA: Using the Spectrum Graph to Infer Peptides [[info](http://rosalind.info/problems/sgra/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_sgra.py)]
* SIGN: Enumerating Oriented Gene Orderings [[info](http://rosalind.info/problems/sign/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_sign.py)]
* SORT: Sorting by Reversals [[info](http://rosalind.info/problems/sort/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_sort.py)]
* SPEC: Inferring Protein from Spectrum [[info](http://rosalind.info/problems/spec/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_spec.py)]
* SPLC: RNA Splicing [[info](http://rosalind.info/problems/splc/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_splc.py)]
* SQ: Square in a Graph [[info](http://rosalind.info/problems/sq/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_sq.py)]
* SSEQ: Finding a Spliced Motif [[info](http://rosalind.info/problems/sseq/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_sseq.py)]
* SSET: Counting Subsets [[info](http://rosalind.info/problems/sset/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_sset.py)]
* SUBO:  Suboptimal Local Alignment [[info](http://rosalind.info/problems/subo/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_subo.py)]
* SUBS: Finding a Motif in DNA [[info](http://rosalind.info/problems/subs/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_subs.py)]
* TFSQ: FASTQ format introduction [[info](http://rosalind.info/problems/tfsq/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_tfsq.py)]
* TRAN: Transitions and Transversions [[info](http://rosalind.info/problems/tran/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_tran.py)]
* TREE: Completing a Tree [[info](http://rosalind.info/problems/tree/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_tree.py)]
* TRIE: Introduction to Pattern Matching [[info](http://rosalind.info/problems/trie/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_trie.py)]
* TS: Topological Sorting [[info](http://rosalind.info/problems/ts/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_ts.py)]
* WFMD: The Wright-Fisher Model of Genetic Drift [[info](http://rosalind.info/problems/wfmd/)] [[code](https://github.com/zonghui0228/Rosalind-Solutions/blob/master/code/rosalind_wfmd.py)]

rosalind-solutions

rosalind-solutions 최신버젼 다운로드

오늘의 추천 프로젝트

Was this content helpful?

Recent Feedback

rosalind-solutions

rosalind-solutions 최신버젼 다운로드

오늘의 추천 프로젝트

Was this content helpful?

Recent Feedback

Download README