Download A method for paralogy trees reconstruction

Survey
yes no Was this document useful for you?
   Thank you for your participation!

* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project

Document related concepts

Essential gene wikipedia , lookup

Maximum parsimony (phylogenetics) wikipedia , lookup

Genomic imprinting wikipedia , lookup

RNA-Seq wikipedia , lookup

Pathogenomics wikipedia , lookup

History of genetic engineering wikipedia , lookup

Artificial gene synthesis wikipedia , lookup

Ridge (biology) wikipedia , lookup

Epigenetics of human development wikipedia , lookup

Genome (book) wikipedia , lookup

Quantitative comparative linguistics wikipedia , lookup

Gene wikipedia , lookup

Microevolution wikipedia , lookup

Gene expression profiling wikipedia , lookup

Biology and consumer behaviour wikipedia , lookup

Minimal genome wikipedia , lookup

Designer baby wikipedia , lookup

Gene expression programming wikipedia , lookup

Computational phylogenetics wikipedia , lookup

Genome evolution wikipedia , lookup

Transcript
A method for paralogy trees construction
R. Marangoni, A. Savona, P. Ferragina, N. Pisanti, , L. Pagli, F. Luccio
Dept. of Computer Science, University of Pisa, Corso Italia 46, 56125 Pisa, Italy.
e-mail: [email protected]
Genes belonging to the same organism are called paralogs when they show a significant similarity
in the sequences, even if they have a different biological function. It is an emergent biological
paradigm that the families of paralogs derive from a mechanism of gene duplication with
modification, repeated many times in the history: this paradigm could be at the basis of the increase
in the organisms complexity observed during evolution.
In order to understand how such process could had taken place, it is necessary to put the paralogs
belonging to same family in a tree which describes the history of their appearance in the genome: a
paralogy tree.
Here we present an algorithm that is able to generate paralogy trees by receiving in input a family of
genes. The reliability of the inferential process has been tested by means a simulator that
implemented different hypotheses on the duplication and modification paradigm. The tests show
that the algorithm is able to correctly reconstruct the right tree when all the genes generated during
the simulated evolutionary time are given in input. The robustness and biological implications and
applications of this algorithm are discussed.