<![CDATA[BOL: Related items]]> https://bioinformaticsonline.com/related/35571?offset=560 https://bioinformaticsonline.com/bookmarks/view/43090/loretta-a-user-friendly-tool-for-assembling-viral-genomes-from-pacbio-sequence-data Wed, 23 Jun 2021 07:54:53 -0500 https://bioinformaticsonline.com/bookmarks/view/43090/loretta-a-user-friendly-tool-for-assembling-viral-genomes-from-pacbio-sequence-data <![CDATA[LoReTTA, a user-friendly tool for assembling viral genomes from PacBio sequence data]]> LoReTTA (Long Read Template-Targeted Assembler), a tool designed for performing de novo assembly of long reads generated from viral genomes on the PacBio platform. LoReTTA exploits a reference genome to guide the assembly process, an approach that has been successful with short reads.

https://academic.oup.com/ve/article/7/1/veab042/6248116

Address of the bookmark: https://academic.oup.com/ve/article/7/1/veab042/6248116

]]> Neel https://bioinformaticsonline.com/file/view/43732/spades-tutorial-pdf Tue, 01 Feb 2022 04:56:43 -0600 https://bioinformaticsonline.com/file/view/43732/spades-tutorial-pdf <![CDATA[Spades tutorial PDF]]> SPAdes—St. Petersburg genome Assembler—was originally developed for de novo assembly of genome sequencing data produced for cultivated microbial isolates and for single-cell genomic DNA sequencing. With time, the functionality of SPAdes was extended to enable assembly of IonTorrent data, as well as hybrid assembly from short and long reads (PacBio and Oxford Nanopore). In this article we present protocols for five different assembly pipelines that comprise the SPAdes package and that are used for assembly of metagenomes and transcriptomes as well as assembly of putative plasmids and biosynthetic gene clusters from whole-genome sequencing and metagenomic datasets. 

]]> Abhimanyu Singh https://bioinformaticsonline.com/bookmarks/view/44529/contigextender-a-new-approach-to-improving-de-novo-sequence-assembly-for-viral-metagenomics-data Wed, 08 May 2024 07:32:45 -0500 https://bioinformaticsonline.com/bookmarks/view/44529/contigextender-a-new-approach-to-improving-de-novo-sequence-assembly-for-viral-metagenomics-data <![CDATA[ContigExtender: a new approach to improving de novo sequence assembly for viral metagenomics data]]> ContigExtender, was developed to extend contigs, complementing de novo assembly. ContigExtender employs a novel recursive Overlap Layout Candidates (r-OLC) strategy that explores multiple extending paths to achieve longer and highly accurate contigs. ContigExtender is effective for extending contigs significantly in in silico synthesized and real metagenomics datasets.

More at https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7953547/

extension process

Address of the bookmark: https://github.com/dengzac/contig-extender

]]> LEGE https://bioinformaticsonline.com/bookmarks/view/44513/mike-an-ultrafast-assembly-and-alignment-free-approach-for-phylogenetic-tree-construction Mon, 08 Apr 2024 06:19:52 -0500 https://bioinformaticsonline.com/bookmarks/view/44513/mike-an-ultrafast-assembly-and-alignment-free-approach-for-phylogenetic-tree-construction <![CDATA[MIKE: an ultrafast, assembly-, and alignment-free approach for phylogenetic tree construction]]> MIKE (MinHash-based k-mer algorithm). This algorithm is designed for the swift calculation of the Jaccard coefficient directly from raw sequencing reads and enables the construction of phylogenetic trees based on the resultant Jaccard coefficient. Simulation results highlight the superior speed of MIKE compared to existing state-of-the-art methods. We used MIKE to reconstruct a phylogenetic tree, incorporating 238 yeast, 303 Zea, 141 Ficus, 67 Oryza, and 43 Saccharum spontaneum samples. MIKE demonstrated accurate performance across varying evolutionary scales, reproductive modes, and ploidy levels, proving itself as a powerful tool for phylogenetic tree construction.

Address of the bookmark: https://github.com/Argonum-Clever2/mike

]]> Abhi https://bioinformaticsonline.com/bookmarks/view/28805/bambus Tue, 16 Aug 2016 08:09:15 -0500 https://bioinformaticsonline.com/bookmarks/view/28805/bambus <![CDATA[Bambus]]>

Bambus 2.0, the second generation Bambus scaffolder available as an open source package. While most other scaffolders are closely tied to a specific assembly program, Bambus accepts the output from most current assemblers and provides the user with great flexibility in choosing the scaffolding parameters. In particular, Bambus is able to accept contig linking data other than specified by mate-pairs. Such sources of information include alignment to a reference genome (Bambus can directly use the output of MUMmer), physical mapping data, or information about gene synteny.

Address of the bookmark: https://www.cbcb.umd.edu/software/bambus2

]]> Jit https://bioinformaticsonline.com/bookmarks/view/32076/ngs-teaching-material Wed, 05 Apr 2017 04:29:06 -0500 https://bioinformaticsonline.com/bookmarks/view/32076/ngs-teaching-material <![CDATA[NGS teaching material]]> High throughput sequencing (HTS) technologies are being applied to a wide range of important topics in biology. However, the analyses of non-model organisms, for which little previous sequence information is available, pose specific problems. This course addresses the specific strengths and weaknesses of alternative HTS technologies, the computational resources needed for HTS, and how to analyze non-model species using HTS. The course consists of a practical training module, HTS bioinformatics training, and lecturing/seminars of HTS approaches specifically targeting non-model organisms.

Address of the bookmark: http://marinetics.org/teaching/hts/Assembly.html

]]> Jit https://bioinformaticsonline.com/bookmarks/view/32905/bigmac-breaking-inaccurate-genomes-and-merging-assembled-contigs-for-long-read-metagenomic-assembly Mon, 22 May 2017 05:43:51 -0500 https://bioinformaticsonline.com/bookmarks/view/32905/bigmac-breaking-inaccurate-genomes-and-merging-assembled-contigs-for-long-read-metagenomic-assembly <![CDATA[BIGMAC : breaking inaccurate genomes and merging assembled contigs for long read metagenomic assembly]]> This tool is for users to upgrade their metagenomics assemblies using long reads. This includes fixing mis-assemblies and scaffolding/gap-filling. If you encounter any issues, please contact me at kklam@eecs.berkeley.edu. My name is Ka-Kit Lam.

https://github.com/kakitone/MetaFinisherSC

https://github.com/kakitone/BIGMAC

Address of the bookmark: https://github.com/kakitone/BIGMAC

]]> Jit https://bioinformaticsonline.com/bookmarks/view/36476/flye-fast-and-accurate-de-novo-assembler-for-single-molecule-sequencing-reads Fri, 04 May 2018 19:16:22 -0500 https://bioinformaticsonline.com/bookmarks/view/36476/flye-fast-and-accurate-de-novo-assembler-for-single-molecule-sequencing-reads <![CDATA[Flye: Fast and accurate de novo assembler for single molecule sequencing reads]]> Flye is a de novo assembler for long and noisy reads, such as those produced by PacBio and Oxford Nanopore Technologies. The algorithm uses an A-Bruijn graph to find the overlaps between reads and does not require them to be error-corrected. After the initial assembly, Flye performs an extra repeat classification and analysis step to improve the structural accuracy of the resulting sequence. The package also includes a polisher module, which produces the final assembly of high nucleotide-level quality.

Address of the bookmark: https://github.com/fenderglass/Flye

]]> Jit https://bioinformaticsonline.com/bookmarks/view/41452/apollo-a-sequencing-technology-independent-scalable-and-accurate-assembly-polishing-algorithm Mon, 16 Mar 2020 10:09:26 -0500 https://bioinformaticsonline.com/bookmarks/view/41452/apollo-a-sequencing-technology-independent-scalable-and-accurate-assembly-polishing-algorithm <![CDATA[Apollo: A Sequencing-Technology-Independent, Scalable, and Accurate Assembly Polishing Algorithm]]> Apollo is an assembly polishing algorithm that attempts to correct the errors in an assembly. It can take multiple set of reads in a single run and polish the assemblies of genomes of any size. Described by Firtina et al. (preliminary version at https://arxiv.org/pdf/1902.04341.pdf

More at https://academic.oup.com/bioinformatics/advance-article/doi/10.1093/bioinformatics/btaa179/5804978?rss=1

Address of the bookmark: https://github.com/CMU-SAFARI/Apollo

]]> BioStar https://bioinformaticsonline.com/researchlabs/view/43913/lsugenomics-lab Thu, 07 Jul 2022 05:26:37 -0500 <![CDATA[lsugenomics Lab]]> In our lab, we seek to characterize and to compare genomes in order to better understand genetic and evolutionary processes linking genotypes to phenotypes.

Sequencing and decoding plant genomes have been integral in our approaches.

The overarching goal of our research is to understand how to interpret complex and fascinating messages embedded in genomes.

https://www.lsugenomics.org/

]]>