Address of the bookmark: https://sourceforge.net/projects/ksnp/files/

https://www.forbio.uio.no/events/courses/2020/Bergen_Phylogenetics_2020.html

ForBio travel grants
We have changed our travel grants rules. ForBio offers both incoming and outgoing travel grants to fund collaborations between ForBio members based in Norway and taxonomic experts up to NOK 14,000. Grants are given for taxonomic training with relevance to the main research project of the applicant, and aim to allow the student to do taxonomic research with specific experts, work with particular collections, or learn new preparation techniques directly from experts.  Participation in external courses, conferences, fieldwork or other kinds of activities which are not classified as expert-in-training visits are no longer eligible for support.  There are two application deadlines: March 1st 2020.

2.Mapmygenome™
Royal Demeure,HUDA Techno Enclave,
Plot No. 12/2, Sector-1 500 081 
Madhapur,Hyderabad
AP, India

3. DNA Labs India

http://www.dnalabsindia.com/lab.php

4.MedGenome Labs Pvt Ltd
(Division of SciGenom Labs Pvt Ltd.)
Plot no: 43A,SDF, 3rd floor
A Block,CSEZ, Kakanad, Cochin
Kerala - 682037 
Phone: 0484 - 2413399
Fax: 0484 - 2413398
Email: info@medgenome.com

5.Narayana Nethralaya

Narayana Hrudayalaya Campus
Narayana Health City
# 258/A, Bommasandra, Hosur Road, 
Bangalore - 560 099 - INDIA.
TEL: +91-80-66660655-0658 
FAX: +91-80-66660650 
Mobile: 9902 821128 (Emergency Only)
e-mail: info@narayananethralaya.com

6.BioAxis DNA Research Centre Private Limited
13-51,Sri Lakshmi Nagar colony,
Besides Big Bazar, Near Kamineni Hospitals
GSI Post BandalGuda (L B Nagar) Hydeabad-500068
Andhra Pradesh (India).
Phone : +91-40-24034503/+91-9246338983

7.Gene Guiide

8th Floor, Embassy Towers, 7 Bungalows Rd, Versova, Andheri West, Mumbai-61 
 09167 117799 
 info@geneguiide.com 

See more at: http://www.geneguiide.com

8.INDIAN BIOSCIENCES
Regd. Office:
G-2 (Ground Floor Rear), Kailash Colony, New Delhi - 110048, India.
Phone: +91 (0)11 29236088, Email: info@inbdna.com.

9.SRL Limited

GP-26, MARUTI INDUSTRIAL ESTATE,

UDYOG VIHAR,SECTOR-18,

GURGAON - 122015

Tel: 0124-3001243 / 0124-3001209

SRL Limited
VASANT VIHAR, 8, PALAM MARG,
NEW DELHI - 110057
Tel: 011 - 4229 5333 

Website: http://www.srlworld.com
National Customer care number:
Call Toll Free : 1800-222-660/1800-102-8282 
E-mail id: customercare@srl.in

10.Tata Memorial Centre,

Advanced Centre for Treatment, Research and Education in Cancer

Kharghar, Navi Mumbai - 410 210, INDIA.

Tel: +91-22-2740 5000

Fax: +91-22-2740 5085

E-mail: mail@actrec.gov.in

Scientists with a long-running Framingham Heart Study looked at 1,932 people (examination of about 1.5 million markers of genetic variations), comparing unrelated friends to unrelated strangers. They found that friends shared about 1% of their genes — a percentage much higher than those shared with strangers.This new findings made it clear that people have more DNA in common with those who are selected as friends than with strangers in the same population. 

The genes that lined up the most were olfactory genes, which deal with smell. The ones that lined up the least were immune system genes. The researchers weren't sure why that happened :/. Olfactory genes might be a straightforward explanation: People who like the same smells tend to be drawn to similar environments, where they meet others with the same tendencies.

Reference:

http://www.pnas.org/content/111/Supplement_3/10796.full

Image : http://i.kinja-img.com

Applications are invited for pre-selection of candidates for Ministry of Science and Technology, Department of Science and Technology INSPIRE Faculty Scheme: a component of “Assured Opportunity for Research Career (AORC)” under INSPIRE in the area of computational Biology/Systems Biology/Bioinformatics.

Candidates having done their B.Tech/B.E. and or M.Sc./M.Tech in Computer Science or Biotechnology and Ph.D. in Systems/ Computational Biology or Bioinformatics may apply in the following format prescribed by DST to the Director, Cluster Innovation Center, University Stadium, GC Narang Marg, University of Delhi, Delhi -11107. Detials of other qualification, age limits etc., please visit www.inspire-dst.gov.in.

Application on the prescribed format may be submitted by email to director@cic.du.ac.in before October 25, 2014. Selected candidates shall be called for an interview. The date, time and venue of the interview shall be informed by email/telephone. For more information about Cluster Innovation Center, please visit https://ducic.ac.in.

(1) they enable exploration of hypotheses, and as such, have become invaluable means to guide research;

(2) they are unique approaches to integrate (in the literal term of the word) biological knowledge, in the form of experimental results; and

(3) they enable connecting biology with other fields of study ranging from physiology to genomics;

This blog, and this software list, is intended to guide the potential user of simulation models.
It is not, in any way, meant to be comprehensive on the very diverse simulation tools that already exist, but focuses on mechanistic, dynamic models. Similarly, it is not meant to provide any coverage of the breadth of applications; however, for interested readers, we provide references to use as a possible starting point.

Simulation models are meant to answer questions which scientists have in a dynamic, quantitative, and often, a pictorial way. Much of the bioinformatics research and its applications, in particular, involve a large number of components, actors, and factors. Assembling these in a coherent framework may seem a daunting task, especially for beginners, and can lead to confusion, even for experienced scientists, especially if the objectives of such an exercise are not well defined. Followings are the list of tools bioinformatician may use to analyze and provide answers to complex biological mechanisms and related problems.

• The market size of the Indian Bioinformatics Industry , FY’2007-FY’2013
• Market segmentation of India bioinformatics industry by application by sectors, FY’2007-FY’2013
• Market Segmentation of India bioinformatics industry by products and services,FY’2007-FY’2013
• Market Segmentation of India bioinformatics industry by applications of bioinformatics ,FY’2007-FY’2013
• India bioinformatics industry trends and developments
• Government regulations and initiatives of India bioinformatics industry
• Major bioinformatics research institutes in India
• Market Share of leading players in bioinformatics industry in India,FY’2013
• Company profiles of major players in India bioinformatics industry
• Future outlook and projections on the basis of revenue in India bioinformatics market, FY’2014-FY’2018

                                                                                                         (Source: Ken Research)

Address of the bookmark: http://www.kenresearch.com/healthcare/biotechnology/india-bioinformatics-industry-research-report/392-91.html

Address of the bookmark: http://learn.genetics.utah.edu/

Following are the list of Ancestral /sequence/ reconstruction (ASR) tools: 

inferCars

Reconstructs contiguous regions of an ancestral genome. Given information about adjacencies between conserved segments in each modern species, our goal is to infer segment order in the ancestral genome. To get a clean and precise statement of the problem, we formalize it using graph theory. We develop an algorithm that identifies a most parsimonious scenario for the history of each individual adjacency, although the whole-genome prediction is not guaranteed to optimize traditional measures like the number of breakpoints. We introduce weights to the graph edges to model the reliability of each adjacency.

ANGES:reconstructing ANcestral GEnomeS maps

A suite of Python programs that allows reconstructing ancestral genome maps from the comparison of the organization of extant-related genomes. ANGES can reconstruct ancestral genome maps for multichromosomal linear genomes and unichromosomal circular genomes. It implements methods inspired from techniques developed to compute physical maps of extant genomes.

Cocos

Constructs phylogenies of multi-domain proteins. With a given species tree and domain phylogenies, the procedure infers the composition of ancestral multi-domain proteins. Cocos implements and extend a suggested algorithmic approach by Behzadi and Vingron in an easy-to-use program. Such method could be applied to reconstruction of partial homologous units such as bacterial operons or protein complexes.

MySSP

Constructs an initial DNA sequence at the root of the tree and simulates evolution across the tree using a variety of common models of DNA evolution. MySSP is a program for the simulation of DNA sequence evolution across a phylogenetic tree. It is designed for large-scale studies, including simulation of multiple replicates and outputs sequences into NEXUS, MEGA, or FASTA formats. MySSP has a fairly simple graphical user interface (GUI) for basic use, but also has a specialized batch script interpreter to allow for more complicated or large-scale simulations.

PARANA: Parsimonious Ancestral Reconstruction And Network Analysis

Performs parsimony based inference of ancestral biological networks. Given multiple extant networks and phylogenetic information relating extant nodes, PARANA finds a parsimonious set of ancestral interaction events (edge gains and losses) which explain the extant networks. The framework adopted by PARANA is able to represent network evolution under models that support gene duplication and loss and independent interaction gain and loss. The method works on both directed and undirected networks and can incorporate asymmetric interaction gain and loss costs. In contrast to previous approaches, PARANA does not require knowing the relative ordering of unrelated duplication events and thus, works on phylogenetic trees even where branch lengths are not provided.

GapAdj: Gapped Adjacencies

A synteny-based method that is flexible enough to handle a model of evolution involving whole genome duplication events, in addition to rearrangements, gene insertions, and losses. Ancestral relationships between markers are defined in term of Gapped Adjacencies, i.e. pairs of markers separated by up to a given number of markers. It improves on a previous restricted to direct adjacencies, which revealed a high accuracy for adjacency prediction, but with the drawback of being overly conservative, i.e. of generating a large number of contiguous ancestral regions (CARs).

ANCESTOR

A web server allowing one to easily and quickly perform the last three steps of the ancestral genome reconstruction procedure. Ancestors implements several alignment algorithms, an indel maximum likelihood solver and a context-dependent maximum likelihood substitution inference algorithm. The results presented by the server include the posterior probabilities for the last two steps of the ancestral genome reconstruction and the expected error rate of each ancestral base prediction.

ProCARs

Reconstructs ancestral gene orders as contiguous ancestral regions (CARs) with a progressive homology-based method. ProCARs runs from a phylogeny tree (without branch lengths needed) with a marked ancestor and a block file. This homology-based method is based on iteratively detecting and assembling ancestral adjacencies, while allowing some micro-rearrangements of synteny blocks at the extremities of the progressively assembled CARs. The method starts with a set of blocks as the initial set of CARs, and detects iteratively the potential ancestral adjacencies between extremities of CARs, while building up the CARs progressively by adding, at each step, new non-conflicting adjacencies that induce the less homoplasy phenomenon. The species tree is used, in some additional internal steps, to compute a score for the remaining conflicting adjacencies, and to detect other reliable adjacencies, in order to reach completely assembled ancestral genomes.

FastML

A user-friendly tool for the reconstruction of ancestral sequences. FastML implements various novel features that differentiate it from existing tools: (i) FastML uses an indel-coding method, in which each gap, possibly spanning multiples sites, is coded as binary data. FastML then reconstructs ancestral indel states assuming a continuous time Markov process. FastML provides the most likely ancestral sequences, integrating both indels and characters; (ii) FastML accounts for uncertainty in ancestral states: it provides not only the posterior probabilities for each character and indel at each sequence position, but also a sample of ancestral sequences from this posterior distribution, and a list of the k-most likely ancestral sequences; (iii) FastML implements a large array of evolutionary models, which makes it generic and applicable for nucleotide, protein and codon sequences; and (iv) a graphical representation of the results is provided, including, for example, a graphical logo of the inferred ancestral sequences.

maxAlike

Reconstructs a genomic sequence for a specific taxon based on sequence homologs in other species. The input is a multiple sequence alignment and a phylogenetic tree that also contains the target species. For this target species, the algorithm computes nucleotide probabilities at each sequence position. Consensus sequences are then reconstructed based on a certain confidence level.

MLGO: Maximum Likelihood for Gene Order Analysis

A web tool for the reconstruction of phylogeny and/or ancestral genomes from gene-order data. MLGO was designed for analysis of large-scale genomic changes including not only rearrangements but also gene insertions, deletions and duplications. MLGO can be used to infer a phylogeny from genome rearrangement and gene order data, and can also obtain an estimation of ancestral genomes, given an input tree. MLGO takes the advantage of binary encoding on gene-order data, supports a fairly general model of genomic evolution (rearrangements plus duplications, insertions, and losses of genomic regions), and successfully accommodates itself into the framework of maximized likelihood.

Image Reference : Wiki

• Freyman, W.A., Johnson, M.G., and C.J. Rothfels. 2022. Homologizer: phylogenetic phasing of gene copies into polyploid subgenomes. bioRxiv 2020.10.22.351486v4

homologizer is implemented in RevBayes. Please see http://revbayes.com to download and install RevBayes. For users without previous RevBayes experience, we recommend the tutorials at http://revbayes.com.

Address of the bookmark: https://github.com/wf8/homologizer