BOL: Related items

Comparative genomics educational material and papers bookmarks

Jit — Wed, 09 Nov 2016 16:23:30 -0600

Alignment of the porcine genome against seven other mammalian genomes (Supplementary Information) identified homologous synteny blocks (HSBs). Using porcine HSBs and stringent filtering criteria, 192 pig-specific evolutionary breakpoint regions (EBRs) were located. The number of porcine EBRs is comparable to the number of bovine-lineage-specific EBRs (100) reported earlier using a slightly lower resolution (500 kilobases (kb)), indicating that both lineages evolved with an average rate of ~2.1 large-scale rearrangements per million years after the divergence from a common cetartiodactyl ancestor ~60 Myr ago². This rate compares to ~1.9 rearrangements per million years within the primate lineage (Supplementary Table 11). A total of 20 and 18 cetartiodactyl EBRs (shared by pigs and cattle) were detected using the pig and human genomes as a reference, respectively.

Address of the bookmark: http://www.nature.com/nature/journal/v491/n7424/abs/nature11622.html

MitoZ: a toolkit for animal mitochondrial genome assembly, annotation and visualization

Neel — Tue, 30 Nov 2021 23:23:57 -0600

MitoZ, consisting of independent modules of de novo assembly, findMitoScaf (find Mitochondrial Scaffolds), annotation and visualization, that can generate mitogenome assembly together with annotation and visualization results from HTS raw reads.

https://academic.oup.com/nar/article/47/11/e63/5377471

Address of the bookmark: https://github.com/linzhi2013/MitoZ

RA Bioinformatics at NATIONAL INSTITUTE OF CANCER PREVENTION & RESEARCH (ICMR)

Thu, 17 Nov 2016 04:11:09 -0600

NATIONAL INSTITUTE OF CANCER PREVENTION & RESEARCH (ICMR)

Noida 201301 (U.P)

Applications are invited upto 21.11.2016 from interested candidates as per details available on NICPR website (www.nicpr.res.in)/ ICMR website (www.icmr.nic.in) to fill up following temporary position in the time bound DHR Project entitled “Next generation EGFR inhibitor identification using ligand based QSAR technique” under Dr. Subhash M. Agarwal, Scientist-D, Division of Bioinformatics.

Research Assistant (One)

Rs.27000/- p.m. (Fixed/temporary)

Essential: M.Sc. in Bioinformatics or related field.

Desirable: Experience in QSAR and structure based drug designing.

More Info : www.icmr.nic.in/icmrnews/NICPR_Advertisement%20for%20RA.pdf

odgi: optimized dynamic genome/graph implementation

Abhimanyu Singh — Tue, 01 Feb 2022 23:42:21 -0600

odgi provides an efficient and succinct dynamic DNA sequence graph model, as well as a host of algorithms that allow the use of such graphs in bioinformatic analyses.

Careful encoding of graph entities allows odgi to efficiently compute and transform pangenomes with minimal overheads. odgi implements a dynamic data structure that leveraged multi-core CPUs and can be updated on the fly.

The edges and path steps are recorded as deltas between the current node id and the target node id, where the node id corresponds to the rank in the global array of nodes. Graphs built from biological data sets tend to have local partial order and, when sorted, the deltas be small. This allows them to be compressed with a variable length integer representation, resulting in a small in-memory footprint at the cost of packing and unpacking.

The RAM and computational savings are substantial. In partially ordered regions of the graph, most deltas will require only a single byte.

Address of the bookmark: https://github.com/pangenome/odgi

quarTeT: a telomere-to-telomere toolkit for gap-free genome assembly and centromeric repeat identification.

Abhi — Sat, 08 Jun 2024 15:54:36 -0500

quarTeT is a collection of tools for T2T genome assembly and basic analysis in automatic workflow.

Task include:

AssemblyMapper : reference-guided genome assembly
GapFiller : long-reads based gap filling
TeloExplorer : telomere identification
CentroMiner : centromere candidate prediction

https://academic.oup.com/hr/article/10/8/uhad127/7197191?login=false

Address of the bookmark: http://www.atcgn.com:8080/quarTeT/home.html

DBT India

Jit — Sun, 04 Dec 2016 22:30:37 -0600

Latest announcement on DBT India.

Calls

Events

Projects

Jobs

Address of the bookmark: http://www.dbtindia.nic.in/out-reach/latest-announcements/

E-MEM: Efficient computation of Maximal Exact Matches

Jit — Thu, 15 Dec 2016 09:30:43 -0600

E-MEM is a C++/OpenMP program designed to efficiently compute MEMs between large genomes. See the README file for instructions on how to use E-MEM.

E-MEM source code

The source code can be downloaded here.

If you use E-MEM, please cite:

N. Khiste, L. Ilie, E-MEM: Efficient computation of Maximal Exact Matches for very large genomes, Bioinformatics 31(4) (2015) 509 -- 514.

For any questions, please contact Lucian Ilie: ilie@uwo.ca

Address of the bookmark: http://www.csd.uwo.ca/~ilie/E-MEM/

Venkatesh Lab

Tue, 20 Dec 2016 04:38:01 -0600

We are using a comparative genomics approach to better understand the structure, function and evolution of the human genome. Our group is one of the pioneers in the field of comparative genomics. We proposed the compact genome of the fugu (Takifugu rubripes) as a model vertebrate genome in 1993 (Nature 366: 265-268, 1993) and determined its whole genome sequence in 2002 (Science 297: 1301-1310, 2002).

More at
https://zfin.org/ZDB-LAB-110408-1
http://www.imcb.a-star.edu.sg/php/venkatesh.php

Finding Patterns in Biological Sequences

Jit — Thu, 22 Dec 2016 10:30:49 -0600

In this report we provide an overview of known techniques for discovery of patterns of biological sequences (DNA and proteins). We also provide biological motivation, and methods of biological verification of such patterns. Finally we list publicly available tools and databases for pattern discovery. On-line supplement is available through http://genetics.uwaterloo.ca/∼tvinar/cs798g/motif.

Address of the bookmark: http://engr.case.edu/li_jing/papers/00798gpattern.pdf

Prodigal (Prokaryotic Dynamic Programming Genefinding Algorithm)

Abhimanyu Singh — Thu, 29 Dec 2016 03:26:45 -0600

Prodigal (Prokaryotic Dynamic Programming Genefinding Algorithm) is a microbial (bacterial and archaeal) gene finding program developed at Oak Ridge National Laboratory and the University of Tennessee. Key features of Prodigal include:

Speed: Prodigal is an extremely fast gene recognition tool (written in very vanilla C). It can analyze an entire microbial genome in 30 seconds or less.
Accuracy: Prodigal is a highly accurate gene finder. It correctly locates the 3' end of every gene in the experimentally verified Ecogene data set (except those containing introns). It possesses a very sophisticated ribosomal binding site scoring system that enables it to locate the translation initiation site with great accuracy (96% of the 5' ends in the Ecogene data set are located correctly).
Specificity: Prodigal's false positive rate compares favorably with other gene identification programs, and usually falls under 5%.
GC-Content Indifferent: Prodigal performs well even in high GC genomes, with over a 90% perfect match (5'+3') to the Pseudomonas aeruginosa curated annotations.
Metagenomic Version: Prodigal can run in metagenomic mode and analyze sequences even when the organism is unknown.
Ease of Use: Prodigal can be run in one step on a single genomic sequence or on a draft genome containing many sequences. It does not need to be supplied with any knowledge of the organism, as it learns all the properties it needs to on its own.
Open Source: Prodigal source code is freely available under the General Public License.

Download the latest version of Prodigal at the Prodigal github page.
or
Browse the wiki documenation.

Address of the bookmark: http://prodigal.ornl.gov/