<![CDATA[BOL: Related items]]> https://bioinformaticsonline.com/related/45249?offset=170 https://bioinformaticsonline.com/bookmarks/view/40604/gapfinisher-a-reliable-gap-filling-pipeline-for-sspace-longread-scaffolder-output Fri, 24 Jan 2020 06:04:40 -0600 https://bioinformaticsonline.com/bookmarks/view/40604/gapfinisher-a-reliable-gap-filling-pipeline-for-sspace-longread-scaffolder-output <![CDATA[gapFinisher: A reliable gap filling pipeline for SSPACE-LongRead scaffolder output]]> gapFinisher is based on the controlled use of a previously published gap filling tool FGAP and works on all standard Linux/UNIX command lines. They compare the performance of gapFinisher against two other published gap filling tools PBJelly and GMcloser.

gapFinisher can fill gaps in draft genomes quickly and reliably.

Address of the bookmark: https://github.com/kammoji/gapFinisher

]]> Rahul Nayak https://bioinformaticsonline.com/bookmarks/view/41675/gapfinisher-a-reliable-gap-filling-pipeline-for-sspace-longread-scaffolder-output Thu, 14 May 2020 15:13:30 -0500 https://bioinformaticsonline.com/bookmarks/view/41675/gapfinisher-a-reliable-gap-filling-pipeline-for-sspace-longread-scaffolder-output <![CDATA[gapFinisher: A reliable gap filling pipeline for SSPACE-LongRead scaffolder output]]> gapFinisher to process SSPACE-LongRead output to fill gaps after the scaffolding. gapFinisher is based on the controlled use of a previously published gap filling tool FGAP and works on all standard Linux/UNIX command lines.

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6733440/

Address of the bookmark: https://github.com/kammoji/gapFinisher

]]> Rahul Nayak https://bioinformaticsonline.com/bookmarks/view/42132/squeezemeta-a-fully-automated-metagenomics-pipeline-from-reads-to-bins Mon, 17 Aug 2020 05:25:10 -0500 https://bioinformaticsonline.com/bookmarks/view/42132/squeezemeta-a-fully-automated-metagenomics-pipeline-from-reads-to-bins <![CDATA[SqueezeMeta: a fully automated metagenomics pipeline, from reads to bins]]> SqueezeMeta is a full automatic pipeline for metagenomics/metatranscriptomics, covering all steps of the analysis. SqueezeMeta includes multi-metagenome support allowing the co-assembly of related metagenomes and the retrieval of individual genomes via binning procedures. Thus, SqueezeMeta features several unique characteristics:

  1. Co-assembly procedure with read mapping for estimation of the abundances of genes in each metagenome
  2. Co-assembly of a large number of metagenomes via merging of individual metagenomes
  3. Includes binning and bin checking, for retrieving individual genomes
  4. The results are stored in a database, where they can be easily exported and shared, and can be inspected anywhere using a web interface.
  5. Internal checks for the assembly and binning steps inform about the consistency of contigs and bins, allowing to spot potential chimeras.
  6. Metatranscriptomic support via mapping of cDNA reads against reference metagenomes

Address of the bookmark: https://github.com/jtamames/SqueezeMeta

]]> BioStar https://bioinformaticsonline.com/bookmarks/view/43062/jcvi-utility-libraries Sat, 08 May 2021 22:04:02 -0500 https://bioinformaticsonline.com/bookmarks/view/43062/jcvi-utility-libraries <![CDATA[JCVI utility libraries]]> Collection of Python libraries to parse bioinformatics files, or perform computation related to assembly, annotation, and comparative genomics.

Address of the bookmark: https://github.com/tanghaibao/jcvi

]]> Jit https://bioinformaticsonline.com/bookmarks/view/44373/mitohifi-a-python-pipeline-for-mitochondrial-genome-assembly-from-pacbio-high-fidelity-reads Tue, 05 Sep 2023 07:31:35 -0500 https://bioinformaticsonline.com/bookmarks/view/44373/mitohifi-a-python-pipeline-for-mitochondrial-genome-assembly-from-pacbio-high-fidelity-reads <![CDATA[MitoHiFi: a python pipeline for mitochondrial genome assembly from PacBio high fidelity reads]]> MitoHiFi v3.2 is a python pipeline distributed under MIT License !

MitoHiFi was first developed to assemble the mitogenomes for a wide range of species in the Darwin Tree of Life Project (DToL)

https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-023-05385-y 

Address of the bookmark: https://github.com/marcelauliano/MitoHiFi

]]> Abhi https://bioinformaticsonline.com/bookmarks/view/44595/squeezemeta-a-fully-automated-metagenomics-pipeline-from-reads-to-bins Sat, 06 Jul 2024 04:29:16 -0500 https://bioinformaticsonline.com/bookmarks/view/44595/squeezemeta-a-fully-automated-metagenomics-pipeline-from-reads-to-bins <![CDATA[SqueezeMeta: a fully automated metagenomics pipeline, from reads to bins]]> SqueezeMeta is a full automatic pipeline for metagenomics/metatranscriptomics, covering all steps of the analysis. SqueezeMeta includes multi-metagenome support allowing the co-assembly of related metagenomes and the retrieval of individual genomes via binning procedures. Thus, SqueezeMeta features several unique characteristics:

  1. Co-assembly procedure with read mapping for estimation of the abundances of genes in each metagenome
  2. Co-assembly of a large number of metagenomes via merging of individual metagenomes
  3. Includes binning and bin checking, for retrieving individual genomes
  4. The results are stored in a database, where they can be easily exported and shared, and can be inspected anywhere using a web interface.
  5. Internal checks for the assembly and binning steps inform about the consistency of contigs and bins, allowing to spot potential chimeras.
  6. Metatranscriptomic support via mapping of cDNA reads against reference metagenomes

Address of the bookmark: https://github.com/jtamames/SqueezeMeta

]]> BioStar https://bioinformaticsonline.com/news/view/19087/dcgor Sat, 08 Nov 2014 14:54:28 -0600 https://bioinformaticsonline.com/news/view/19087/dcgor <![CDATA[dcGOR]]> An R package for analysing ontologies and protein domain annotations has been published in PLoS Computational Biology (http://dx.doi.org/10.1371/journal.pcbi.1003929). The package is distributed as part of CRAN (http://cran.r-project.org/package=dcGOR), and also at GitHub for version control.

The dedicated website is available in http://supfam.org/dcGOR, from which several demos are also provided:

1. Analysing SCOP domains: http://supfam.org/dcGOR/demo-Fang.html

2. Analysing Pfam domains: http://supfam.org/dcGOR/demo-Basu.html

3. Analysing InterPro domains: http://supfam.org/dcGOR/demo-Customisation.html

 

]]> Martin Jones https://bioinformaticsonline.com/bookmarks/view/27090/canu-assembling-large-genomes-with-single-molecule-sequencing-and-locality-sensitive-hashing Tue, 26 Apr 2016 11:38:10 -0500 https://bioinformaticsonline.com/bookmarks/view/27090/canu-assembling-large-genomes-with-single-molecule-sequencing-and-locality-sensitive-hashing <![CDATA[CANU: Assembling Large Genomes with Single-Molecule Sequencing and Locality Sensitive Hashing.]]> Canu is a fork of the Celera Assembler designed for high-noise single-molecule sequencing (such as the PacBio RSII or Oxford Nanopore MinION). The software is currently alpha level, feel free to use and report issues encountered.

Canu is a hierachical assembly pipeline which runs in four steps:

  • Detect overlaps in high-noise sequences using MHAP
  • Generate corrected sequence consensus
  • Trim corrected sequences
  • Assemble trimmed corrected sequences

Read the documentation

New release https://github.com/marbl/canu/releases

Address of the bookmark: https://github.com/marbl/canu

]]> Jit https://bioinformaticsonline.com/bookmarks/view/27430/mosaik-a-hash-based-algorithm-for-accurate-next-generation-sequencing-short-read-mapping Fri, 20 May 2016 18:53:49 -0500 https://bioinformaticsonline.com/bookmarks/view/27430/mosaik-a-hash-based-algorithm-for-accurate-next-generation-sequencing-short-read-mapping <![CDATA[MOSAIK: A Hash-Based Algorithm for Accurate Next-Generation Sequencing Short-Read Mapping]]> MOSAIK is a stable, sensitive and open-source program for mapping second and third-generation sequencing reads to a reference genome. Uniquely among current mapping tools, MOSAIK can align reads generated by all the major sequencing technologies, including Illumina, Applied Biosystems SOLiD, Roche 454, Ion Torrent and Pacific BioSciences SMRT. Indeed, MOSAIK was the only aligner to provide consistent mappings for all the generated data (sequencing technologies, low-coverage and exome) in the 1000 Genomes Project. To provide highly accurate alignments, MOSAIK employs a hash clustering strategy coupled with the Smith-Waterman algorithm. This method is well-suited to capture mismatches as well as short insertions and deletions. To support the growing interest in larger structural variant (SV) discovery, MOSAIK provides explicit support for handling known-sequence SVs, e.g. mobile element insertions (MEIs) as well as generating outputs tailored to aid in SV discovery.

Address of the bookmark: http://journals.plos.org/plosone/article?id=10.1371/journal.pone.0090581

]]> Neel https://bioinformaticsonline.com/bookmarks/view/27839/lorma-a-tool-for-correcting-sequencing-errors-in-long-reads-such-those-produced-by-pacific-biosciences-sequencing-machines Wed, 15 Jun 2016 17:18:36 -0500 https://bioinformaticsonline.com/bookmarks/view/27839/lorma-a-tool-for-correcting-sequencing-errors-in-long-reads-such-those-produced-by-pacific-biosciences-sequencing-machines <![CDATA[LoRMA: a tool for correcting sequencing errors in long reads such those produced by Pacific Biosciences sequencing machines]]> LoRMA is a tool for correcting sequencing errors in long reads such those produced by Pacific Biosciences sequencing machines.

Publication:

  • L. Salmela, R. Walve, E. Rivals, and E. Ukkonen: Accurate selfcorrection of errors in long reads using de Bruijn graphs. Accepted to RECOMB-Seq 2016.

Download:

Address of the bookmark: https://www.cs.helsinki.fi/u/lmsalmel/LoRMA/

]]> Jit