-
UPenn (Postdoc)
- Philadelphia, PA, USA
- https://www.bio.upenn.edu/people/coby-viner
- https://orcid.org/0000-0001-8097-6991
- @cobyviner
- in/cobyviner
- https://scholar.google.ca/citations?user=RUrFz2oAAAAJ
Highlights
- Pro
Stars
tools for working with Bisulfite Sequencing data while preserving reads intrinsic dependencies
ChIP-seq analysis notes from Ming Tang
Booyer-Moore-Horspool string search algorithm implementation in C++
a Bioinformatics Application for Navigating De novo Assembly Graphs Easily
C++ htslib/bwa-mem/fermi interface for interrogating sequence data
ConsensusCruncher is a tool that suppresses errors in next-generation sequencing data by using unique molecular identifiers (UMIs) to amalgamate reads derived from the same DNA template into a cons…
A DNA Sequence Alignment/Map (SAM) library for Clojure
An all-purpose Clojure graph data structure that implements Loom protocols and more.
A beautiful and useful prompt for your shell
a python package for fast random access to sequences from plain and gzipped FASTA/Q files
Pysam is a Python package for reading, manipulating, and writing genomics data such as SAM/BAM/CRAM and VCF/BCF files. It's a lightweight wrapper of the HTSlib API, the same one that powers samtool…
arara is a TeX automation tool based on rules and directives. It gives you a way to enhance your TeX experience. This is a mirror repository.
🍸 Web-based database system for flow cell management (incl. REST API)
Spearmint is a package to perform Bayesian optimization according to the algorithms outlined in the paper: Practical Bayesian Optimization of Machine Learning Algorithms. Jasper Snoek, Hugo Laroche…
MaxHS: a hybrid Maxsat solver developed by Jessica Davies and Fahiem Bacchus
Stanford Network Analysis Platform (SNAP) is a general purpose network analysis and graph mining library.
CNF generator in DIMACS format. It produces common families of CNFs.
Implementation of branch and bound algorithm for maximum clique problem
SAT solver assistant. Converts propositions (p ^ q) ==> CNF ==> DIMACS CNF files.
Implementation of ehaustive clique enumeration algorithm GreedyBB
Quickly compute all maximal cliques of a graph