BOL: Related items

Mercator

Jit — Mon, 06 Feb 2017 04:20:36 -0600

Our basic strategy in building homology maps is to use exons that are orthologous in multiple genomes as map "anchors." Given K genomes, the steps in the map construction are as follows:

For each genome, obtain a set of exon annotations. These annotations can be a combination of both exon predictions (e.g. Genscan) and annotations that have been experimentally verified (e.g. RefSeq). Ideally, we would like to have these annotations be as sensitive as possible. Specificity is not a concern, as incorrect annotations are not likely not have significant alignments with other gene annotations.
Compare all exons against all exons in other genomes and record significant alignments between exons. Currently, we use BLAT to do this all-vs-all comparison with alignments being performed in protein space.
Construct a graph with each vertex corresponding to a exon and edges between vertices whose corresponding exons have significant alignments.
Identify cliques in this graph. These cliques are potential anchors to be used in the map.
Starting with the largest cliques (those that have exons in all or most of the genomes), join neighboring (adjacent in genomic coordinates, in each genome) cliques to form runs. Smaller cliques that are inconsistent with runs formed by larger cliques are filtered out. After the smallest cliques have been considered, cliques that are not part of a run are discarded.
The extents of each run in each genome are outputted as orthologous segments. The cliques from each run are used to output the exact genomic coordinates of anchors within each orthologous segment. These anchors can be used by genomic alignment programs (such as MAVID) to do a detailed alignment of each orthologous segment.

https://www.biostat.wisc.edu/~cdewey/mercator/

Address of the bookmark: https://www.biostat.wisc.edu/~cdewey/mercator/

lordFAST: sensitive and Fast Alignment Search Tool for LOng noisy Read sequencing Data

BioJoker — Tue, 27 Nov 2018 04:43:57 -0600

lordFAST is a sensitive tool for mapping long reads with high error rates. lordFAST is specially designed for aligning reads from PacBio sequencing technology but provides the user the ability to change alignment parameters depending on the reads and application.

lordFAST, a novel long-read mapper that is specifically designed to align reads generated by PacBio and potentially other SMS technologies to a reference. lordFAST not only has higher sensitivity than the available alternatives, it is also among the fastest and has a very low memory footprint.

Address of the bookmark: https://github.com/vpc-ccg/lordfast

fineSTRUCTURE v2 & GLOBETROTTER

Shruti Paniwala — Mon, 13 Feb 2017 08:40:23 -0600

Software available at this site

FineSTRUCTURE version 2, a pipeline for running ChromoPainter and FineSTRUCTURE for population inference. A GUI is available for interpretation. Download from the Downloads page.
FineSTRUCTURE R scripts, a facility for exploring the results when the GUI is unavailable.
GLOBETROTTER, the admixture dating method based on ChromoPainter. Download from the Downloads page.
AdmixturePainting, A set of R tools to inmterpret the results of ADMIXTURE and STRUCTURE-like mixture models.
RADpainter, finestructure and ChromoPainter for RAD tag data used for non-model organisms.
Scripts to perform many types of conversion. Included in the main software download from the Downloads page.

What this page is This page provides information about and downloads for methodology for Chromosome Painting. It is not a facility to analyse your genome. Sorry if you were misled by the punchy name!
About Chromosome Painting Painting is an efficient way of identifying important haplotype information from dense genotype data. It describes ancestry in an efficient way suitable for a range of further analyses, including population identification and admixture dating.

Address of the bookmark: http://paintmychromosomes.com/

MUM&Co is a simple bash script that uses Whole Genome Alignment information provided by MUMmer (v4) to detect variants.

Rahul Nayak — Wed, 27 Apr 2022 04:34:12 -0500

MUM&Co is able to detect:
Deletions, insertions, tandem duplications and tandem contractions (>=50bp & <=150kb)
Inversions (>=1kb) and translocations (>=10kb)

Address of the bookmark: https://github.com/SAMtoBAM/MUMandCo

DAVI: Deep learning-based tool for alignment and single nucleotide variant identification

Jit — Tue, 16 Mar 2021 05:41:33 -0500

DAVI consists of models for both global and local alignment and for variant calling. We have evaluated the performance of DAVI against existing state-of-the-art tool sets and found that its accuracy and performance is comparable to existing tools used for bench-marking. We further demonstrate that while existing tools are based on data generated from a specific sequencing technology, the models proposed in DAVI are generic and can be used across different NGS technologies as well as across different species

https://iopscience.iop.org/article/10.1088/2632-2153/ab7e19/pdf

Address of the bookmark: https://github.com/gguptaiitd/NEAT

DAGchainer: Computing Chains of Syntenic Genes in Complete Genomes

Abhimanyu Singh — Fri, 17 Feb 2017 16:13:35 -0600

The DAGchainer software computes chains of syntenic genes found within complete genome sequences. As input, DAGchainer accepts a list of gene pairs with sequence homology along with their genome coordinates. Using a scoring function which accounts for the distance between neighboring genes on each DNA molecule and the BLAST E-value score between homologs, maximally scoring chains of ordered gene pairs are computed and reported. This algorithm can be used to mine large evolutionary conserved regions of genomes between two organisms. Alternatively, by examining colinear sets of homologous genes found within a single genome, segmental genome duplications can be revealed.

This software distribution includes both the DAGchainer utility and a Java-based graphical interface that allows the inputs and outputs to be navigated and interrogated dynamically.

Address of the bookmark: http://dagchainer.sourceforge.net/

ACANA: An accurate and consistent alignment tool for DNA sequences

Jit — Wed, 06 Dec 2017 09:45:29 -0600

ACANA is an accurate and consistent alignment tool for DNA sequences. ACANA is specifically designed for aligning sequences that share only some moderately conserved regions and/or have a high frequency of long insertions or deletions. It attempts to combine the best of local and global alignments algorithms in searching for evolutionarily related regions of sequences in order to achieve the best alignment. ACANA is also robust to the small changes of alignment parameters, particularly the gap extension score. As an accurate alignment tool, ACANA is particularly useful in comparative sequence analysis for identifying conserved functional regulatory elements.

Address of the bookmark: https://www.niehs.nih.gov/research/resources/software/biostatistics/acana/index.cfm

zPicture: A dynamic blastz alignment visualization

Archana Malhotra — Tue, 30 Jan 2018 16:03:08 -0600

zPicture is a dynamic alignment and visualization tool that is based on blastz alignment program utilized by PipMaker. zPicture alignments can be automatically submitted to rVista 2.0 to identify conserved transcription factor binding sites.

Address of the bookmark: https://zpicture.dcode.org/

Bioinformatics opening at ICGEB NEW DELHI

Thu, 02 Mar 2017 04:16:36 -0600

ICGEB NEW DELHI

Applications are invited for:

Junior Research Fellow, in a DBT funded project, is available in Translational Health Group, ICGEB, New Delhi

Qualifications:

Education: M.Sc. (preferably in Biotechnology, Life Sciences or Zoology, Chemistry, Bioinformatics). Candidates with hands on experience on GC-MS data acquisition and analysis will be given preference. Bioinformatics expertise required.

Fellowship: As per DBT guidelines.

Tenure: The position is purely on temporary basis with an initial tenure of six months and based on satisfactory performance may continue until the completion of the project.

Closing date for applications: 04/03/2017

Please send a "TWO PAGE" CV by email to: th.icgeb@gmail.com on or before the last date.

Research Associate, in a DBT funded project, is available in Translational Health Group, ICGEB, New Delhi

Qualifications:

Education: Ph.D. (in Biology, Biotechnology, Chemistry, Bioinformatics). Candidates with hands on experience on GC-MS data acquisition and analysis will be given preference.

Fellowship: As per DBT guidelines.

Tenure: The position is purely on temporary basis with an initial tenure of six months and based on satisfactory performance may continue until the completion of the project.

Closing date for applications: 04/03/2017

Please send a "TWO PAGE" CV by email to: th.icgeb@gmail.com on or before the last date.

LAMSA: fast split read alignment with long approximate matches

Jit — Tue, 15 May 2018 04:44:42 -0500

LAMSA (Long Approximate Matches-based Split Aligner) is a novel split alignment approach with faster speed and good ability of handling SV events. It is well-suited to align long reads (over thousands of base-pairs). LAMSA takes takes the advantage of the rareness of SVs to implement a specifically designed two-step strategy. That is, LAMSA initially splits the read into relatively long fragments and co-linearly align them to solve the small variations or sequencing errors, and mitigate the effect of repeats. The alignments of the fragments are then used for implementing a sparse dynamic programming (SDP)-based split alignment approach to handle the large or non-co-linear variants. We benchmarked LAMSA with simulated and real datasets having various read lengths and sequencing error rates, the results demonstrate that it is substantially faster than the state-of-the-art long read aligners; mean-while, it also has good ability to handle various categories of SVs. LAMSA is open source and free for non-commercial use. LAMSA is mainly designed by Bo Liu & Yan Gao and developed by Yan Gao in Center for Bioinformatics, Harbin Institute of Technology, China.

Address of the bookmark: https://github.com/hitbc/LAMSA