igel-kun Goto Github PK

2lp

implementation of an exact algorithm for 2-layer planarization

bpp-core

Bio++ Core Library

bpp-phyl

Bio++ Phylogenetic Library

code-used-on-daniel-lemire-s-blog

This is a repository for the code posted on my blog

cpp_learning

cpp_learning_project

Tower Control Simulation Project

cppbestpractices

Collaborative Collection of C++ Best Practices

doi-finder

A python script to automatically resolve the Digital Object Identifier (DOI) of all bibliographic entries in a bibtex database.

eccetera

enblend

enblend non fortran ebuild

gentoo

[MIRROR] Official Gentoo ebuild repository

gladeclust

implementation of an exact algorithm for consensus clustering - with GTK GUI

hornet-js

Framework de développement basé sur typescript, nodejs, reactjs, ... respectant les référentiels généraux de l'état Français : RGAA, RGS, RGI

irc

linuxgsm

Linux Game Server Managers_

lr_consensus

malign_cc

converting a multiple alignment to an instance of Chordal Completion

modbridge

Kernel module for on-the-fly file conversion

pace_phylo_instances

convert multiple-sequence-alignments to character-state intersection graphs

phylo_tools

Library to work with phylogenetic networks aiming at pure performance

pyload

A free and open source personal cloud storage as well as download manager for all kind of operating systems and devices, designed to be extremely lightweight and runnable on personal pc or headless server.

recophync

RecoPhyNC is a Python software which tests whether a phylogenetic network, given as a file containing a list of arcs, is level-k, tree-child, nearly tree-child, genetically stable, reticulation-visible, tree-sibling, compressed or nearly stable.

round_robin_iter

an iterator multiplexing other iterators in round-robin fashion

sansreplace

Sampling without replacement algorithms

silly_ebuilds

a collection of some ebuilds I wrote

status

reconstruct a graph from a given sequence of stati

sublime-text

Sublime Text Gentoo overlay

sudoku

A non-branching sudoku-solver using "transitive-chain analysis"

transed

implementation of an exact algorithm (+greedy heuristic) to edit a given digraph into a transitive one.

vc_min_deg

code to discover reduction rules for VC on small-degree-graphs