BOL: Related items

BioGeek Fun

Jit — Sun, 16 Mar 2014 06:33:31 -0500

1. A futuristic computational biology student was told to write "It is in my gene!!!" on the board 100 times as a punishment. here's his response -

use warnings;
for ($count=1; $count <=100; $count++) { print "It is in my gene!!!";}

I guess, he is gonna to be a real biogeek. Nice try though. Smart kid.

2. In some perl script I found this
. . . . . .
. . . . . .
# It works for me, only God understood how it is working
while (/(<\/[^>]+>)|(<[^>]+>)|(<[^>]+>)$|([^><]+)/go) {
            $startGene=$1;
            $beginChromosome=$2;

. . . . . .
.. . . . . .
}

3. One more interesting message in Perl found …. It will must tickle you bone :)
open(my $fh, "<", "gene.txt") or kill " Me if you think this is a mistake :$!";

4. From the Perl

while () { # "The Mothership Connection is here!"
print “$_\n”; # Printing the offspring :)

5. Perl message
if ($1) { print “Just found a the error in chromosome !!!, yahoo…”; else { “That is not error, but mutation you moron!”;

6. One genome database curator walk in wine bar asked the bartender:
CREATE TABLE gene IF NOT EXISTS SexOnTheBeach;

Bioinformatician at work !!!

Neel — Sat, 23 Aug 2014 04:44:55 -0500

Yet another peep up view of a bioinformatician research laboratory ...

Scripted DNA !!!

Jit — Mon, 17 Aug 2015 17:44:04 -0500

As per bioinformatician DNA is partially scripted ;) You dont believe in it. Please have a look at image carefully:)

AVID: A Global Alignment Program

Archana Malhotra — Wed, 24 May 2017 05:19:28 -0500

A new global alignment method called AVID. The method is designed to be fast, memory efficient, and practical for sequence alignments of large genomic regions up to megabases long. We present numerous applications of the method, ranging from the comparison of assemblies to alignment of large syntenic genomic regions and whole genome human/mouse alignments. We have also performed a quantitative comparison of AVID with other popular alignment tools. To this end, we have established a format for the representation of alignments and methods for their comparison. These formats and methods should be useful for future studies. The tools we have developed for the alignment comparisons, as well as the AVID program, are publicly available. See Web Site References section for AVID Web address and Web addresses for other programs discussed in this paper.

Address of the bookmark: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC430967/

GffCompare: Program for processing GTF/GFF files

Jit — Tue, 09 Jul 2019 13:35:13 -0500

The program gffcompare can be used to compare, merge, annotate and estimate accuracy of one or more GFF files (the “query” files), when compared with a reference annotation (also provided as GFF).

Address of the bookmark: https://ccb.jhu.edu/software/stringtie/gffcompare.shtml

Opera: An optimal genome scaffolding program

Jit — Mon, 27 Nov 2017 10:18:20 -0600

Opera (Optimal Paired-End Read Assembler) is a sequence assembly program (http://en.wikipedia.org/wiki/Sequence_assembly ). It uses information from paired-end or long reads to optimally order and orient contigs assembled from shotgun-sequencing reads.

An updated version called OPERA-LG has been re-engineered with features for the assembly of large and complex genomes.

Song Gao, Denis Bertrand, Burton K. H. Chia and Niranjan Nagarajan. OPERA-LG: efficient and exact scaffolding of large, repeat-rich eukaryotic genomes with performance guarantees. Genome Biology, May 2016, doi: 10.1186/s13059-016-0951-y.

Song Gao, Wing-Kin Sung, Niranjan Nagarajan. Opera: reconstructing optimal genomic scaffolds with high-throughput paired-end sequences. Journal of Computational Biology, Sept. 2011, doi:10.1089/cmb.2011.0170.

https://genomebiology.biomedcentral.com/articles/10.1186/s13059-016-0951-y

Address of the bookmark: https://sourceforge.net/projects/operasf/

MCMCTREE: a phylogenetic program for Bayesian estimation of species divergence times

Poonam Mahapatra — Sat, 02 Jun 2018 07:40:06 -0500

MCMCTREE is a phylogenetic program for Bayesian estimation of species divergence times using soft fossil constraints under various molecular clock models. This is part of the PAML package. In this tutorial I will analyze an easy example modified from dataset of Inoue et al. (2010). Here we conduct a commonly used time estimation method, "Approximate Likelihood Method", for the datasets including more than 10 species.

Address of the bookmark: http://www.fish-evol.com/mcmctreeExampleVert6/text1Eng.html

kallisto: a program for quantifying abundances of transcripts from bulk and single-cell RNA-Seq data

Jit — Mon, 07 Jan 2019 10:35:14 -0600

kallisto is a program for quantifying abundances of transcripts from bulk and single-cell RNA-Seq data, or more generally of target sequences using high-throughput sequencing reads. It is based on the novel idea of pseudoalignment for rapidly determining the compatibility of reads with targets, without the need for alignment. On benchmarks with standard RNA-Seq data, kallisto can quantify 30 million human reads in less than 3 minutes on a Mac desktop computer using only the read sequences and a transcriptome index that itself takes less than 10 minutes to build. Pseudoalignment of reads preserves the key information needed for quantification, and kallisto is therefore not only fast, but also as accurate as existing quantification tools. In fact, because the pseudoalignment procedure is robust to errors in the reads, in many benchmarks kallisto significantly outperforms existing tools. kallisto is described in detail in:

Nicolas L Bray, Harold Pimentel, Páll Melsted and Lior Pachter, Near-optimal probabilistic RNA-seq quantification, Nature Biotechnology 34, 525–527 (2016), doi:10.1038/nbt.3519

Address of the bookmark: https://pachterlab.github.io/kallisto/about

Cactus: a reference-free whole-genome multiple alignment program

Jit — Mon, 12 Aug 2019 07:52:33 -0500

Cactus is a reference-free whole-genome multiple alignment program. The principal algorithms are described here: https://doi.org/10.1101/gr.123356.111

Cactus uses substantial resources. For primate-sized genomes (3 gigabases each), you should expect Cactus to use approximately 120 CPU-days of compute per genome, with about 120 GB of RAM used at peak. The requirements scale roughly quadratically, so aligning two 1-megabase bacterial genomes takes only 1.5 CPU-hours and 14 GB RAM.

Address of the bookmark: https://github.com/ComparativeGenomicsToolkit/cactus

AutoDock Vina: an open-source program for doing molecular docking.

BioStar — Sat, 13 Jun 2020 07:55:56 -0500

AutoDock Vina is an open-source program for doing molecular docking. It was designed and implemented by Dr. Oleg Trott in the Molecular Graphics Lab at The Scripps Research Institute. It is especially effective for protein-ligand docking. AutoDock 4 is available under the GNU General Public License. AutoDock is one of the most cited docking software applications in the research community.

http://vina.scripps.edu/

Address of the bookmark: http://vina.scripps.edu/