Sciweavers

COCOON
2005
Springer
13 years 10 months ago
Conserved Interval Distance Computation Between Non-trivial Genomes
Recently, several studies taking into account the ability for a gene to be absent or to have some copies in genomes have been proposed, as the examplar distance [11, 6] or the gene...
Guillaume Blin, Romeo Rizzi
CSB
2005
IEEE
223views Bioinformatics» more  CSB 2005»
13 years 10 months ago
Automatic Protein Function Annotation through Candidate Ortholog Clusters from Incomplete Genomes
Annotation of protein function often arises in the context of partially complete genomes but is not adequately addressed. We present an annotation method by extracting ortholog cl...
Akshay Vashist, Casimir A. Kulikowski, Ilya B. Muc...
CSB
2005
IEEE
114views Bioinformatics» more  CSB 2005»
13 years 10 months ago
Tree Decomposition Based Fast Search of RNA Structures Including Pseudoknots in Genomes
Searching genomes for RNA secondary structure with computational methods has become an important approach to the annotation of non-coding RNAs. However, due to the lack of effici...
Yinglei Song, Chunmei Liu, Russell L. Malmberg, Fa...
RECOMB
2007
Springer
13 years 11 months ago
Parts of the Problem of Polyploids in Rearrangement Phylogeny
Abstract. Genome doubling simultaneously doubles all genetic markers. Genome rearrangement phylogenetics requires that all genomes analyzed have the same set of orthologs, so that ...
Chunfang Zheng, Qian Zhu, David Sankoff
WABI
2009
Springer
181views Bioinformatics» more  WABI 2009»
13 years 11 months ago
Decoding Synteny Blocks and Large-Scale Duplications in Mammalian and Plant Genomes
Abstract. The existing synteny block reconstruction algorithms use anchors (e.g., orthologous genes) shared over all genomes to construct the synteny blocks for multiple genomes. T...
Qian Peng, Max A. Alekseyev, Glenn Tesler, Pavel A...