cbsugobii05.biohpc.cornell.edu - To build open-source genomic data management and analysis tools to enable breeders to implement genomic and marker-assisted selection as part of their routine breeding programs.
To transform breeding by connecting diverse data with precision...
sourceforge.net - Modern genome sequencing strategies are highly sensitive to contamination making the detection of foreign DNA sequences an important part of analysis pipelines. Here we use Taxoblast, a simple pipeline with a graphical user interface, for the...
bmcgenomics.biomedcentral.com - SWGIS v2.0 along with the EuGI database, which houses GIs identified in 66 different eukaryotic species, and the EuGI web-resource, provide the first comprehensive resource for studying HGT in...
github.com - git clone https://github.com/lh3/minimap2
cd minimap2 && make
# long sequences against a reference genome
./minimap2 -a test/MT-human.fa test/MT-orang.fa > test.sam
# create an index first and then map
./minimap2 -d MT-human.mmi...
www.softberry.com - FGENESH is the fastest (50-100 times faster than GenScan) and most accurate gene finder available - see the figure and the table below. In recent rice genome sequencing projects, it was cited "the most successful (gene finding) program (Yu et...
github.com - RepeatModeler2 represents a valuable addition to the genome annotation toolkit that will enhance the identification and study of TEs in eukaryotic genome sequences. RepeatModeler2 is available as source code or a containerized package under an open...
github.com - gget is a free, open-source command-line tool and Python package that enables efficient querying of genomic databases. gget consists of a collection of separate but interoperable modules, each designed to facilitate one type of...
http://genomeribbon.com/ - Visualization has played an extremely important role in the current genomic revolution to inspect and understand variants, expression patterns, evolutionary changes, and a number of other relationships. However, most of the information in...
code.google.com - lideSort-BPR ( b reak p oint r eads) is based on a fast algorithm for all-against-all comparisons of short reads and theoretical analyses of the number of neighboring reads. When applied to a dataset with a sequencing...