Skip to content
Commits on Jul 30, 2009
  1. Rename mg_node -> mg

    Samuel Tesla committed Jul 30, 2009
  2. Set up rough supervision tree.

    The general idea behind this structure is that a request is received and this causes a query to be created. The query then creates a worker for each permutation of the mutation points and each worker actually queries the storage. The workers message the query when they have a total, and the query sums them up and returns that total to the original requester.
    
    So, for example. A request comes in: {"AGGT", 1}. That's to find all of the sequences that could be reached by a single mutation from "AGGT". So the query launches a worker for each of the possible mutation points: ["$GGT", "A$GT", "AG$T", "AGG$"]. The records in the storage are keyed by these kinds of strings.
    Samuel Tesla committed Jul 30, 2009
  3. Remove registered modules from app file for now.

    Samuel Tesla committed Jul 29, 2009
  4. Added a (very) brief TODO list.

    Samuel Tesla committed Jul 29, 2009
Commits on Jul 29, 2009
  1. Add API for reading from and writing to the storage.

    Samuel Tesla committed Jul 28, 2009
Commits on Jul 28, 2009
  1. Added storage server

    Samuel Tesla committed Jul 28, 2009
Commits on Jul 16, 2009
  1. Get a match function working.

    Samuel Tesla committed Jul 16, 2009
  2. Add function to produce list of all possible mutation positions of a …

    …particular Degree
    Samuel Tesla committed Jul 16, 2009
Commits on Jul 7, 2009
  1. Add rakefile to build stuff and clean stuff.

    Samuel Tesla committed Jul 7, 2009
Commits on Jul 6, 2009
  1. Added import module

    Samuel Tesla committed Jul 6, 2009
  2. Initial Commit

    Samuel Tesla committed Jul 6, 2009
Something went wrong with that request. Please try again.