Skip to content
Snippets Groups Projects

Repository graph

You can move around the graph by using the arrow keys.
Select Git revision
  • assemblyinfo
  • main default protected
  • master
3 results
Created with Raphaël 2.2.04Mar226Feb1330Jan2429Nov206224Oct16Assembling paths works, also added a parser for fastq inputsmastermasterAssembling paths works, also added a parser for fastq inputs, but it contains bugs at the momentFinding the starts of the walks works in the AssemblePath classThere is a solution for finding the good neighbors of every good node, constructing a walks from these is still not implemented. The evaluations for the nodes are made by the Evaluation... classes. These currently contain simplified methods.Restructured the project to store the information which is needed for the reconstruction of the path in a variable belonging to a Data class. The nodes get an Evaluation variable which decides if the given node is a candidate for being in a path. The fasta minhash does not yet work with the changes.Changed the output of the program to a file, it can be found in the output folder. Also made the MinHash class abstract with 3 children classes, which use different algorithms for minhash. One is for comparing sequences, and the other two are for graph searches. Also added a new class HandleProcess to create the appropriate instance of these classes based on the user input.This is the point where I got until finishing my thesis work. I corrected some indexing issues.SRA assembliesassemblyinfoassemblyinfoAssembly queryThis is a working version, with the following properties:This is a working version, with the following properties:This is a working version, with the following properties:This is a working version, with the following properties:Initial commitmainmain