No description, website, or topics provided.
Switch branches/tags
Nothing to show
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Failed to load latest commit information.
data
.gitignore Include data files in repository Aug 23, 2015
2sum.py Tidied up Jul 27, 2018
ASMQ.py
BA4M.py
BA7A.py
BA7B.py Refactored some more common code Sep 26, 2017
BA7C.py started BA8E Implement Hierarchical Clustering Sep 26, 2017
BA7D.py
BA7E.py
BA7F.py
BA7G.py
BA8A.py
BA8B.py
BA8C.py
BA8D.py Added copyright notice Sep 11, 2017
BA8E.py
BINS.py
CORR.py Started on DBRO. Moved revc into new utilit file rosalind.py Sep 11, 2017
DBRU.py
DDEG.py Added copyright notice Sep 11, 2017
DEG.py
FRMT.py
GASM.py Solved GASM Sep 13, 2017
GBK.py
GREP.py Extra doco Sep 16, 2017
INS.py
INV.py
KMP.py
LICENSE
LONG.py
MED.py
MER.py Added copyright notice Sep 11, 2017
MS.py Added copyright notice Sep 11, 2017
PAR.py
PAR3.py
PCOV.py GREP passes sample dataset test. Started moving input to rosalind.py Sep 16, 2017
PTRA.py
QS.py
README.md Solved 2SUM Jul 26, 2018
bfs.py
cat.py
count-kmer-occurrences.py Tidied up Jul 27, 2018
cstr.py Additional doco Oct 5, 2017
ctbl.py
maj.py
mend.py
newick.py
nwck.py Added copyright notice Sep 11, 2017
pmch.py
rear.py
rosalind.py
rosalind.wpr

README.md

Bioinformatics

Code inspired by Finding Hidden Messages in DNA (Bioinformatics I) and from Rosalind. NB: functions generally used zero based indexing; Rodalind used 1-based.

Name Description
2sum.py 2SUM
ASMQ.py Assessing Assembly Quality with N50 and N75
BA4M.py Solve the Turnpike Problem
BA7A.py Compute Distances Between Leaves
BA7B.py Limb Length Problem
BA7C.py Implement Additive Phylogeny
BA7D.py Implement UPGMA
BA7E.py Implement the Neighbor Joining Algorithm
BA7F.py Implement SmallParsimony
BA7G.py Adapt SmallParsimony to Unrooted Trees
BA8A.py Implement FarthestFirstTraversal
BA8B.py Compute the Squared Error Distortion
BA8C.py Implement the Lloyd Algorithm for k-Means Clustering
BA8D.py Implement the Soft k-Means Clustering Algorithm
BA8E.py Implement Hierarchical Clustering
bfs.py Beadth First search !
BINS.py Binary Search
CORR.py Error Correction in Reads
count-kmer-occurrences.py Determine number of times each kmer appears in DNA, allowing for reverse complements and d-neighbourhoods
ctbl.py Creating a Character Table
DBRU.py Constructing a De Bruijn Graph
DDEG.py Double-Degree Array
DEG.py Degree Array
FRMT.py Data Formats
GASM.py Genome Assembly Using Reads
GBK.py GenBank Introduction
GREP.py Genome Assembly with Perfect Coverage and Repeats
INS.py Insertion Sort
INV.py Counting Inversions (WIP)
kmp.py Speeding Up Motif Finding
LICENSE License Agreement
LONG.py Genome Assembly as Shortest Superstring
maj.py Majority Element
MED.py Median
mend.py Inferring a Genotype from a Pedigree
MER.py Merge Two Sorted Arrays
MS.py Mergesort
newick.py
nwck.py Distances in Trees
PAR.py 2-Way Partition
PAR3.py 3-Way Partition
PCOV.py Genome Assembly with Perfect Coverage
pmch.py Perfect Matchings and RNA Secondary Structures
PTRA.py Protein Translation
QS.py Quicksort
README.md This file
rear.py Reversal distance
rosalind.py Shared code
rosalind.wpr WingWare Project File