Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
P
python_graph_minhash
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Package registry
Container registry
Model registry
Operate
Environments
Terraform modules
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
Juhász Judit
python_graph_minhash
Repository graph
Repository graph
You can move around the graph by using the arrow keys.
assemblyinfo
Select Git revision
Branches
3
assemblyinfo
main
default
protected
master
3 results
Begin with the selected commit
Created with Raphaël 2.2.0
4
Mar
2
26
Feb
13
30
Jan
24
29
Nov
20
6
2
24
Oct
16
Assembling paths works, also added a parser for fastq inputs
master
master
Assembling paths works, also added a parser for fastq inputs, but it contains bugs at the moment
Finding the starts of the walks works in the AssemblePath class
There 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 assemblies
assemblyinfo
assemblyinfo
Assembly query
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:
This is a working version, with the following properties:
Initial commit
main
main
Loading