Eyras Eduardo, Caccamo Mario, Curwen Val, Clamp Michele
The Wellcome Trust Sanger Institute, The Wellcome Trust Genome Campus, Hinxton, Cambridge CB10 1SA, UK.
Genome Res. 2004 May;14(5):976-87. doi: 10.1101/gr.1862204.
We describe a novel algorithm for deriving the minimal set of nonredundant transcripts compatible with the splicing structure of a set of ESTs mapped on a genome. Sets of ESTs with compatible splicing are represented by a special type of graph. We describe the algorithms for building the graphs and for deriving the minimal set of transcripts from the graphs that are compatible with the evidence. These algorithms are part of the Ensembl automatic gene annotation system, and its results, using ESTs, are provided at www.ensembl.org as ESTgenes for the mosquito, Caenorhabditis briggsae, C. elegans, zebrafish, human, mouse, and rat genomes. Here we also report on the results of this method applied to the human and mouse genomes.
我们描述了一种新算法,用于推导与映射在基因组上的一组ESTs的剪接结构兼容的最小非冗余转录本集合。具有兼容剪接的ESTs集合由一种特殊类型的图表示。我们描述了构建这些图以及从与证据兼容的图中推导最小转录本集合的算法。这些算法是Ensembl自动基因注释系统的一部分,其使用ESTs的结果在www.ensembl.org上作为蚊子、秀丽隐杆线虫、斑马鱼、人类、小鼠和大鼠基因组的ESTgenes提供。在此,我们还报告了将该方法应用于人类和小鼠基因组的结果。