A Parsimony Approach to Genome-Wide Ortholog Assignment
From MaRDI portal
Publication:3596286
DOI10.1007/11732990_47zbMATH Open1302.92067DBLPconf/recomb/FuCVNZJ06OpenAlexW2125029457WikidataQ57869666 ScholiaQ57869666MaRDI QIDQ3596286FDOQ3596286
Authors: Zheng Fu, Xin Chen, Vladimir Vacic, Peng Nan, Yang Zhong, Tao Jiang
Publication date: 30 August 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11732990_47
Recommendations
- OMG! Orthologs in multiple genomes -- competing graph-theoretical formulations
- A local-global gene comparison for ortholog detection in two closely related eukaryotes species
- A fast and exact algorithm for the exemplar breakpoint distance
- Complete characterization of incorrect orthology assignments in best match graphs
- Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
Cited In (7)
- A local-global gene comparison for ortholog detection in two closely related eukaryotes species
- Gene orthology inference via large-scale rearrangements for partially assembled genomes
- A network flow approach to the minimum common integer partition problem
- Quantifying hierarchical conflicts in homology statements
- Title not available (Why is that?)
- Inferring clusters of orthologous and paralogous transcripts
- OMG! Orthologs in multiple genomes -- competing graph-theoretical formulations
This page was built for publication: A Parsimony Approach to Genome-Wide Ortholog Assignment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3596286)