Efficient mapping of large cDNA/EST databases to genomes: A comparison of two different strategies

dc.contributor.author	Wawra, Christian
dc.contributor.author	Abouelhoda, Mohamed I.
dc.contributor.author	Ohlebusch, Enno
dc.contributor.editor	Torda, Andrew
dc.contributor.editor	Kurtz, Stefan
dc.contributor.editor	Rarey, Matthias
dc.date.accessioned	2019-08-27T08:22:38Z
dc.date.available	2019-08-27T08:22:38Z
dc.date.issued	2005
dc.description.abstract	This paper presents a comparison of two strategies for cDNA/EST mapping: The seed-and-extend strategy and the fragment-chaining strategy. We derive theoretical results on the statistics of fragments of type maximal exact match. Moreover, we present efficient fragment-chaining algorithms that are simpler than previous ones. In experiments, we compared our implementation of the fragment-chaining strategy with the seed-and-extend strategy implemented in the software tool BLAT.	en
dc.identifier.isbn	3-88579-400-4
dc.identifier.pissn	1617-5468
dc.identifier.uri	https://dl.gi.de/handle/20.500.12116/24938
dc.language.iso	en
dc.publisher	Gesellschaft für Informatik e.V.
dc.relation.ispartof	German Conference on Bioinformatics 2005 (GCB 2005)
dc.relation.ispartofseries	Lecture Notes in Informatics (LNI) - Proceedings, Volume P-71
dc.title	Efficient mapping of large cDNA/EST databases to genomes: A comparison of two different strategies	en
dc.type	Text/Conference Paper
gi.citation.endPage	43
gi.citation.publisherPlace	Bonn
gi.citation.startPage	29
gi.conference.date	5.-7. Oktober 2005
gi.conference.location	Hamburg
gi.conference.sessiontitle	Regular Research Papers

Dateien

1 - 1 von 1