paralogy-corrector-new-master

所属分类:Linux/Unix编程
开发工具:C++
文件大小:595KB
下载次数:2
上传日期:2016-01-06 14:46:52
上 传 者xiaobs1
说明:  给定一个基因树,物种树和列表所需的同源基因对,找到一个基因树尽可能满足这些约束条件的解,用QT开发的
(Given a gene tree and a list of required tree species homologous genes, finding a gene tree solutions possible to meet these constraints, with the QT development)

文件列表:
LICENSE (18027, 2015-01-06)
Makefile (5378, 2015-01-06)
ParalogyCorrector.pro (865, 2015-01-06)
bin (0, 2015-01-06)
bin\ParalogyCorrector (2143009, 2015-01-06)
main.cpp (20976, 2015-01-06)
src (0, 2015-01-06)
src\div (0, 2015-01-06)
src\div\define.h (376, 2015-01-06)
src\div\tinydir.h (10429, 2015-01-06)
src\div\util.h (7785, 2015-01-06)
src\trees (0, 2015-01-06)
src\trees\.directory (120, 2015-01-06)
src\trees\autester.cpp (7776, 2015-01-06)
src\trees\autester.h (1340, 2015-01-06)
src\trees\genespeciestreeutil.cpp (7306, 2015-01-06)
src\trees\genespeciestreeutil.h (1812, 2015-01-06)
src\trees\newicklex.cpp (4953, 2015-01-06)
src\trees\newicklex.h (1579, 2015-01-06)
src\trees\node.cpp (10453, 2015-01-06)
src\trees\node.h (8882, 2015-01-06)
src\trees\paralogycorrector.cpp (10587, 2015-01-06)
src\trees\paralogycorrector.h (2639, 2015-01-06)
src\trees\polysolver.cpp (17742, 2015-01-06)
src\trees\polysolver.h (4870, 2015-01-06)
src\trees\polysolver_distance.cpp (32922, 2015-01-06)
src\trees\polysolver_distance.h (4831, 2015-01-06)
src\trees\polysolver_nad.cpp (41682, 2015-01-06)
src\trees\polysolver_nad.h (3679, 2015-01-06)
src\trees\treeinfo.cpp (5754, 2015-01-06)
src\trees\treeinfo.h (2438, 2015-01-06)
src\trees\treeiterator.cpp (4010, 2015-01-06)
src\trees\treeiterator.h (1669, 2015-01-06)
test.parc (7180, 2015-01-06)

ParalogyCorrector ============== Given a rooted binary gene tree + species tree, and a list of orthologous gene pairs, the program finds a gene tree that has the given orthology relationships (according to LCA reconciliation) that minimizes the Robinson-Foulds distance with the original tree. The input is given as a .parc file, which can contain a list of trees to correct. The format of the .parc file is a pseudo-xml format (see test.parc for an example). The file has no root node and tag opening/closing must be preceded and followed by a newline character.. Each tree to correct is contained in a ``` ... tag. Each instance tag must contain the child tags : [The id of the gene tree. Will be included in the output.] [The gene tree in newick format. Each leaf must have a label, which will be used for the gene species mapping.] [The species tree in newick format. Each leaf must have a label, which will be used for the gene species mapping.] [ The map from the genes (leaf labels of the gene tree) to their corresponding species (leaf labels of the species tree). Each gene must be mapped. One mapping per line is given, and the format is gene_name:species_name ] [ The gene orthologies to satisfy, using the leaf labels from the gene tree. One constraint per line is given, and the format is gene_name1:gene_name2 The given constraints do not need to be symmetric (ie gene_name2:gene_name1 does not need to be included - the output is unmodified whether it is included or not). ] ``` The output is a pseudo-xml with the following fields (one instance per tree): [the tree id of the current instance, as given in the .parc file] [the newick of the original gene tree, as given in the .parc file] [ the newick of the corrected gene tree, as given in the .parc file] [if an error occurred, the tag message will be added. It typically comes up when all given orthologs were already orthologs in the given gene tree, and nothing was corrected. ] Example calls : ``` ParalogyCorrector -i "test.parc" -o "test.parc.out" ``` Command line arguments ---------------------- -i [infile] : infile is the .parc file that contains the required trees to correct/orthologies -o [outfile]: (optional) the output is written in outfile, or on stdout if no outfile is specified -f [old|new] : (optional, default=new) for backwards compatibility, setting -f old formats the output as in the older versions

近期下载者

相关文件


收藏者