BOL: Related items

PRISM

Jit — Sat, 10 Dec 2016 15:19:40 -0600

PRISM is a software for split read (reads which span across a structrual variant -- SV ) mapping and SV calling from the mapping result. PRISM is able to detect small insertions and abitrary size deletions, inversions and tandom duplications with the direction of discordant read pairs. PRISM_CTX is a tool for detecting inter-chromosome trans-location events.

PRISM and PRISM_CTX were originally designed and written by Michael Brudno and Yue Jiang, The original PRISM publication can be found here.

The authors may be contacted via e-mail at: prism at cs.toronto.edu.

Additional information is available in the PRISM README file and PRISM_CTX README file.

http://compbio.cs.toronto.edu/prism/

Address of the bookmark: http://compbio.cs.toronto.edu/prism/

ScaffMatch

Jit — Tue, 13 Dec 2016 10:23:56 -0600

caffMatch is a novel scaffolding tool based on Maximum-Weight Matching able to produce high-quality scaffolds from NGS data (reads and contigs). The tool is written in Python 2.7. It also includes a bash script wrapper that calls aligner in case one needs to first map reads to contigs (instead of providing .sam files).

The arguments accepted by ScaffMatch are:

-w) Working directory -- this is the directory where ScaffMatch files are stored. These are .sam files produced after mapping reads to contigs and the resulting scaffolds file `scaffolds.fa` fasta file;

-c) Contig fasta file;

-m) Command line argument with no options. It is used when .sam files are used instead of reads .fastq files. Do not use this option if you provide reads files;

-1) (Comma separated list of) either .fastq or .sam file(s) corresponding to the first read of the read pair;

-2) (Comma separated list of) either .fastq or .sam file(s) corresponding to the second read of the read pair;

-i) (Comma separated list of) insert size(s) of the library(-ies);

-s) (Comma separated list of) library(-ies) standard deviation(s) of insert size(s);

-t) Bundle threshold. Pairs of contigs supported by number of read pairs less than the value of this argument are discarded. Optional argument, by default it is equal to 5;

-g) Matching heuristics: use `max_weight` for Maximum Weight Matching heuristics with the Insertion step, use `backbone` for Maximum Weight Matching heuristics without the Insertion step, use `greedy` for Greedy Matching heuristics;

-l) Log file - where to store the logs. Optional argument. By default, stdout is used.

Address of the bookmark: http://alan.cs.gsu.edu/NGS/?q=content/scaffmatch

pyScaf

Bulbul — Mon, 19 Dec 2016 14:20:33 -0600

pyScaf orders contigs from genome assemblies utilising several types of information:

paired-end (PE) and/or mate-pair libraries (NGS-based mode)
long reads (NGS-based mode)
synteny to the genome of some related species (reference-based mode)

Scaffolding

In reference-based mode, pyScaf uses synteny to the genome of closely related species in order to order contigs and estimate distances between adjacent contigs.

Contigs are aligned globally (end-to-end) onto reference chromosomes, ignoring:

matches not satisfying cut-offs (--identity and --overlap)
suboptimal matches (only best match of each query to reference is kept)
and removing overlapping matches on reference.

In preliminary tests, pyScaf performed superbly on simulated heterozygous genomes based on C. parapsilosis (13 Mb; CANPA) and A. thaliana (119 Mb; ARATH) chromosomes, reconstructing correctly all chromosomes always for CANPA and nearly always for ARATH (Figures in dropbox, CANPA table, ARATH table).
Runs took ~0.5 min for CANPA on 4 CPUs and ~2 min for ARATH on 16 CPUs.

Important remarks:

Reduce your assembly before (fasta2homozygous.py) as any redundancy will likely break the synteny.
pyScaf works better with contigs than scaffolds, as scaffolds are often affected by mis-assemblies (no de novo assembler / scaffolder is perfect...), which breaks synteny.
pyScaf works very well if divergence between reference genome and assembled contigs is below 20% at nucleotide level.
pyScaf deals with large rearrangements ie. deletions, insertion, inversions, translocations. Note however, this is experimental implementation!
Consider closing gaps after scaffolding.

Address of the bookmark: https://github.com/lpryszcz/pyScaf

MCscan

Bulbul — Thu, 22 Dec 2016 03:53:58 -0600

MCscan is a computer program that can simultaneously scan multiple genomes to identify homologous chromosomal regions and subsequently align these regions using genes as anchors. This is the toolset for generating the synteny correspondences in Plant Genome Duplication Database. It is intended as an easy-to-use and quick way to identify conserved gene arrays both within the same genome and across different genomes.

More at http://chibba.agtec.uga.edu/duplication/mcscan/

Address of the bookmark: http://chibba.agtec.uga.edu/duplication/mcscan/

YAHA

Jit — Fri, 20 Jan 2017 05:38:05 -0600

YAHA, a fast and flexible hash-based aligner. YAHA is as fast and accurate as BWA-SW at finding the single best alignment per query and is dramatically faster and more sensitive than both SSAHA2 and MegaBLAST at finding all possible alignments. Unlike other aligners that report all, or one, alignment per query, or that use simple heuristics to select alignments, YAHA uses a directed acyclic graph to find the optimal set of alignments that cover a query using a biologically relevant breakpoint penalty. YAHA can also report multiple mappings per defined segment of the query. We show that YAHA detects more breakpoints in less time than BWA-SW across all SV classes, and especially excels at complex SVs comprising multiple breakpoints.

Availability: YAHA is currently supported on 64-bit Linux systems. Binaries and sample data are freely available for download from http://faculty.virginia.edu/irahall/YAHA.

Contact:

http://genome.wustl.edu/people/groups/detail/hall-lab/

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

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/

GenomeComp

Jit — Fri, 17 Feb 2017 08:38:32 -0600

GenomeComp is a tool for summarizing, parsing and visualizing the genome wide sequence comparison results derived from voluminous BLAST textual output, so as to locate the rearrangements, insertions or deletions of genome segments between species or strains.

It can be easily used to compare, parsing and visualize large genomic sequences, especially closely related genomes such as inter-species or inter-strains. In addition, it can also show other sequence features like repeat sequence distributions in one whole-genome DNA sequence by comparing the genome to itself.

It is a stand-alone graphical user interface (GUI) program which runs on Linux, Unix, Mac OS X (tested on version 10.2.4 only) and Microsoft Windows platforms and is written in Perl/Tk.

Address of the bookmark: http://www.mgc.ac.cn/GenomeComp/

Krona

Jit — Wed, 22 Mar 2017 04:47:35 -0500

Krona allows hierarchical data to be explored with zooming, multi-layered pie charts. Krona charts can be created using an Excel template or KronaTools, which includes support for several bioinformatics tools and raw data formats. The interactive charts are self-contained and can be viewed with any modern web browser (see Browser support).

Address of the bookmark: https://github.com/marbl/Krona/wiki

List of GOI approved peer reviewed bioinformatics and computational biology journals

Jit — Tue, 25 Apr 2017 05:03:27 -0500

Unfortunately, we now live in a world where the integrity of peer-reviewed journals is being threatened by the rise of the academic version of fake news – something many call “predatory publishing". Mostly in academic publishing world, "predatory open access publishing" is an exploitative open-access publishing business model that involves charging publication fees to authors without providing the editorial and publishing services associated with legitimate journals (open access or not).

Nearly 20% of the such journals have a flashy impact factor and quick publication time, which are quick give-aways. Interestingly, under contact address, some journal websites do not even provide any address to contact. All of this has led to the emergence of a new and dark market of deceptive publishers that exploit the concept of open access and provide channels for “scientific journal” publication with little or no peer review. For a fee, they will publish almost anything – even if the study was fatally flawed. And these journals provide a forum that can be used as a channel to publish fraudulent “advocacy research.” You can find list of certain such publishers at "Beall's List" http://beallslist.weebly.com/

Keeping all these in mind, Government of India (GOI) decided to approved certain bioinformatics and computational biology journals for your research publication.

Following are the list of GOI validated and peer reviewed bioinformatics and computational biology journals:

NOTE:Each journal details are in following order Tittle\nSource\nSubject.
Point to remember: The list of journals are NOT sorted in any ascending or descending order.

If I missed any other GOI validated bioinformatics journal, then please report me in comment section.

Open Bioinformatics Journal
Scopus
Computer Science; Engineering; Medicine

PROTEINS-STRUCTURE FUNCTION AND BIOINFORMATICS
WoS
BIOLOGY & BIOCHEMISTRY

Advances and Applications in Bioinformatics and Chemistry
Scopus
Biochemistry, Genetics and Molecular Biology Chemistry; Computer Science

Advances in Bioinformatics
Scopus
Biochemistry, Genetics and Molecular Biology; Computer Science; Engineering

Applied Bioinformatics
Scopus
Agricultural and Biological Sciences; Computer Science

BIOINFORMATICS
WoS & Scopus
COMPUTER SCIENCE

Bioinformatics and Biology Insights
Scopus
Biochemistry, Genetics and Molecular Biology; Computer Science; Mathematics

BMC BIOINFORMATICS
WoS & Scopus
COMPUTER SCIENCE

BRIEFINGS IN BIOINFORMATICS
WoS & Scopus
COMPUTER SCIENCE

Computational systems bioinformatics / Life Sciences Society. Computational Systems Bioinformatics Conference
Scopus
Medicine

Current Bioinformatics
WoS & Scopus
COMPUTER SCIENCE

Current Protocols in Bioinformatics
Scopus
Biochemistry, Genetics and Molecular Biology

JOURNAL OF COMPUTATIONAL INTELLIGENCE IN BIOINFORMATICS
ICI
BIOLOGICAL SCIENCE

Journal of integrative bioinformatics
Scopus
Medicine

Journal of Proteomics and Bioinformatics
Scopus
Biochemistry, Genetics and Molecular Biology; Computer Science

Mathematical Biology and Bioinformatics
Scopus
Engineering; Mathematics

Trends in Bioinfprmatics
Scopus
Computer Science

Eurasip Journal on Bioinformatics and Systems Biology
Scopus
General; Computer Science; Mathematics; Medicine

Evolutionary Bioinformatics
WoS & Scopus
COMPUTER SCIENCE

Genomics, Proteomics and Bioinformatics
Scopus
Biochemistry, Genetics and Molecular Biology;Mathematics

IEEE/ACM Transactions on Computational Biology and Bioinformatics
Scopus
Biochemistry, Genetics and Molecular Biology;Mathematics

IEEE-ACM Transactions on Computational Biology and Bioinformatics
WoS
COMPUTER SCIENCE

International Journal of Bioinformatics Research and Application
Scopus
Biochemistry, Genetics and Molecular Biology; Medicine, Health

International Journal o f Data M ining and Bioinformatics
WoS & Scopus
COMPUTER SCIENCE

IPSJ Transactions on Bioinformatics
Scopus
Biochemistry, Genetics and Molecular Biology;Computer Science

Journal of Bioinformatics and Computational Biology
WoS & Scopus
COMPUTER SCIENCE

Journal of Clinical Bioinformatics
Scopus
Medicine

PLoS Computational Biology
WoS & Scopus
BIOLOGY & BIOCHEMISTRY

Reviews in Computational Chemistry
WoS & Scopus
CHEMISTRY

RSC Theoretical and Computational Chemistry Series
Scopus
Chemistry; Computer Science

Annual Reports in Computational Chemistry
Scopus
Chemistry; Mathematics

Computational and Structural Biotechnology Journal
Scopus
Biochemistry, Genetics and Molecular Biology; Computer Science

Computational and Theoretical Chemistry
WoS & Scopus
CHEMISTRY

COMPUTATIONAL BIOLOGY AND CHEMISTRY
WoS & Scopus
COMPUTER SCIENCE

COMPUTATIONAL CHEMISTRY
WoS
CHEMISTRY

Journal of Theoretical and Computational Chemistry
Scopus
Chemistry; Computer Science

Theoretical and Computational Chemistry
Scopus
Chemistry

Wiley Interdisciplinary Reviews: Computational Molecular Science
Scopus
Biochemistry, Genetics and Molecular Biology;Chemistry; Computer Science; Materials Science; Mathematics

Wiley Interdisciplinary Reviews- Computational Molecular Science
WoS
CHEMISTRY

Interdisciplinary sciences, computational life sciences
Scopus
Medicine

Interdisciplinary Sciences-Computational Life Science
WoS
Biology and Biochemistry

International Journal of Computational Biology and Drug Design
Scopus
Computer Science; Pharmacology, Toxicology and Pharmaceutics

Fastq format

Jit — Wed, 03 May 2017 04:23:32 -0500

FASTQ format is a text-based format for storing both a biological sequence (usually nucleotide sequence) and its corresponding quality scores. Both the sequence letter and quality score are each encoded with a single ASCII character for brevity.

It was originally developed at the Wellcome Trust Sanger Institute to bundle a FASTA sequence and its quality data, but has recently become the de facto standard for storing the output of high-throughput sequencing instruments such as the Illumina Genome Analyzer.^[1]

Address of the bookmark: https://en.wikipedia.org/wiki/FASTQ_format