BOL: Related items

Hifiasm: a haplotype-resolved assembler for accurate Hifi reads

Jit — Thu, 24 Dec 2020 10:03:36 -0600

Hifiasm is a fast haplotype-resolved de novo assembler for PacBio Hifi reads. It can assemble a human genome in several hours and works with the California redwood genome, one of the most complex genomes sequenced so far. Hifiasm can produce primary/alternate assemblies of quality competitive with the best assemblers. It also introduces a new graph binning algorithm and achieves the best haplotype-resolved assembly given trio data.

Address of the bookmark: https://github.com/chhylp123/hifiasm

Apollo: A Sequencing-Technology-Independent, Scalable, and Accurate Assembly Polishing Algorithm

BioStar — Mon, 16 Mar 2020 10:09:26 -0500

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

DeCoSTAR - Detection of Co-evolution

Jit — Fri, 14 Apr 2017 06:27:25 -0500

DeCoSTAR is a software which aims at reconstructing ancestral gene or genome organizations, in the form of sets of neighborhood relations -adjacencies- between pairs of ancestral genes or gene domains.
Ancestral genes or domains are deduced from reconciled gene trees in a context of birth, speciation, duplication, loss, transfer, which are either given as input or computed with the ecceTERA package, to which DeCoSTAR is integrated. DeCoSTAR constructs parsimonious scenarios of gains and breakages of adjacencies, and contains in particular all the features of previous software DeCo, DeCoLT, ArtDeCo and DeClone. It provides statistical supports on ancestral adjacencies, or the possibility to handle badly assembled genomes.
DeCoSTAR is able to reconstruct the histories of domains inside genes, including gene fusion and fission events, as well as ancestral genome structures for dozens of whole genomes from all kingdoms of life in a few minutes.

Address of the bookmark: http://pbil.univ-lyon1.fr/software/DeCoSTAR/

MALVA: Genotyping by Mapping-free ALlele Detection of Known VAriants

Jit — Tue, 28 Jan 2020 03:39:22 -0600

MALVA is able to genotype multi-allelic SNPs and indels without mapping reads

MALVA calls correctly more indels than the most widely adopted genotyping pipelines

Mapping-free approaches are as accurate as alignment-based ones, while being faster

More at https://www.sciencedirect.com/science/article/pii/S2589004219302366

https://www.sciencedirect.com/science/article/pii/S2589004219302366

Address of the bookmark: https://github.com/AlgoLab/malva

Computational resources for TE discovery and TE detection

Abhimanyu Singh — Mon, 12 Feb 2018 10:29:18 -0600

Transposable Elements (TEs) to genome structure and evolution as well as their impact on genome sequencing, assembly, annotation and alignment has generated increasing interest in developing new methods for their computational analysis.

Following are the list of resource and location for TE discovery and TE detection:

BLASTER suite http://urgi.versailles.inra.fr/development/blaster/

Censor http://www.girinst.org/censor/download.php

find_ltr http://darwin.informatics.indiana.edu/cgi-bin/evolution/ltr.pl

FINDMITE http://jaketu.biochem.vt.edu/dl_software.htm

HMMER http://hmmer.janelia.org/

LTR_FINDER http://tlife.fudan.edu.cn/ltr_finder/

LTR_STRUC http://www.genetics.uga.edu/retrolab/data/LTR_Struc.html

LTR_MINER http://genomebiology.com/2004/5/10/R79/suppl/s7

LTR_par http://www.eecs.wsu.edu/~ananth/software.htm

MAK http://wesslercluster.plantbio.uga.edu/mak06.html

MaskerAid http://blast.wustl.edu/maskeraid/

mer-engine http://mer-engine.cshl.edu/mer-home.php

mreps http://bioinfo.lifl.fr/mreps/

PILER http://www.drive5.com/piler/

PLOTREP http://repeats.abc.hu/cgi-bin/plotrep.pl

RepBase http://www.girinst.org/

RepeatFinder http://cbcb.umd.edu/software/RepeatFinder/

RepeatGluer http://nbcr.sdsc.edu/euler/intro_tmp.htm

RepeatMasker http://www.repeatmasker.org/

RepeatRunner http://www.yandell-lab.org/repeat_runner/index.html

RepeatScout http://repeatscout.bioprojects.org/

repeat-match http://mummer.sourceforge.net/

REPuter http://www.genomes.de/

RetroMap http://www.burchsite.com/bioi/RetroMapHome.html

SMaRTFinder http://bioinf.dimi.uniud.it/software/software/smartfinder

Tandem Repeats Finder http://tandem.bu.edu/trf/trf.html

Transposon Cluster Finder http://www.mssm.edu/labs/warbup01/paper/files.html

TE nest http://www.plantgdb.org/prj/TE_nest/TE_nest.html

TRANSPO http://alggen.lsi.upc.es/recerca/search/transpo/transpo.html

TSDfinder http://www.ncbi.nlm.nih.gov/CBBresearch/Landsman/TSDfinder/

Tu Lab TE tools http://jaketu.biochem.vt.edu/dl_software.htm

WU-BLAST http://blast.wustl.edu

SvABA: Genome-wide detection of structural variants and indels by local assembly

Abhimanyu Singh — Mon, 21 Jan 2019 17:58:56 -0600

SvABA is a method for detecting structural variants in sequencing data using genome-wide local assembly. Under the hood, SvABA uses a custom implementation of SGA (String Graph Assembler) by Jared Simpson, and BWA-MEM by Heng Li. Contigs are assembled for every 25kb window (with some small overlap) for every region in the genome. The default is to use only clipped, discordant, unmapped and indel reads, although this can be customized to any set of reads at the command line using VariantBam rules. These contigs are then immediately aligned to the reference with BWA-MEM and parsed to identify variants. Sequencing reads are then realigned to the contigs with BWA-MEM, and variants are scored by their read support.

Address of the bookmark: https://github.com/walaj/svaba

Platypus – R package for object detection and image segmentation.

BioStar — Mon, 09 Nov 2020 02:56:25 -0600

platypus is an R package for object detection and semantic segmentation. Currently using

platypus you can perform:

multi-class semantic segmentation using U-Net architecture
multi-class object detection using YOLOv3 architecture

You can install the latest version of platypus with remotes package:

remotes::install_github("maju116/platypus")

Note that in order to install platypus you need to install keras and tensorflow packages and Tensorflow version >= 2.0.0 ( Tensorflow 1.x will not be supported!)

Address of the bookmark: https://github.com/maju116/platypus

dnaPipeTE: a pipeline designed to find, annotate and quantify Transposable Elements

Jit — Mon, 12 Aug 2019 21:56:08 -0500

dnaPipeTE (for de-novo assembly & annotation Pipeline for Transposable Elements), is a pipeline designed to find, annotate and quantify Transposable Elements in small samples of NGS datasets. It is very useful to quantify the proportion of TEs in newly sequenced genomes since it does not require genome assembly and works on small datasets (< 1X).

https://github.com/clemgoub/dnaPipeTE/wiki/dnaPipeTE-WIKI-home

Address of the bookmark: https://github.com/clemgoub/dnaPipeTE

Josefa González Lab

Thu, 19 Aug 2021 08:52:56 -0500

Lab focus on understanding how organisms adapt to their environments. They combine omics approaches with detailed molecular and phenotypic analyses to get a comprehensive picture of adaptation. Our aim at being internationally recognized as a leading lab in the field of environmental adaptation.
Lab share our passion for science with the general public by leading outreach projects aimed at increasing science awareness.

More at https://www.biologiaevolutiva.org/gonzalez_lab/

FOGSAA: Fast Optimal Global Sequence Alignment Algorithm

Jit — Fri, 08 Dec 2017 14:41:08 -0600

Sequence alignment algorithms are widely used to infer similarirty and the point of differences between pair of sequences. FOGSAA is a fast Global alignment algorithm. It is basically a branch and bound approach which starts branch expansion in a greedy way taking the symbols from the given pair of sequences (protein or nucleotide) and results in an optimal alignment faster than conventional dymanic programming techniques. It is also better than the heuristic methods with respect to alignment quality.

Address of the bookmark: http://www.isical.ac.in/~bioinfo_miu/FOGSAA.htm