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

Zusammenfassung
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.
  • Vollständige Referenz
  • BibTeX
Wawra, C., Abouelhoda, M. I. & Ohlebusch, E., (2005). Efficient mapping of large cDNA/EST databases to genomes: A comparison of two different strategies. In: Torda, A., Kurtz, S. & Rarey, M. (Hrsg.), German Conference on Bioinformatics 2005 (GCB 2005). Bonn: Gesellschaft für Informatik e.V.. (S. 29-43).
@inproceedings{mci/Wawra2005,
author = {Wawra, Christian AND Abouelhoda, Mohamed I. AND Ohlebusch, Enno},
title = {Efficient mapping of large cDNA/EST databases to genomes: A comparison of two different strategies},
booktitle = {German Conference on Bioinformatics 2005 (GCB 2005)},
year = {2005},
editor = {Torda, Andrew AND Kurtz, Stefan AND Rarey, Matthias} ,
pages = { 29-43 },
publisher = {Gesellschaft für Informatik e.V.},
address = {Bonn}
}
DateienGroesseFormatAnzeige
GI-Proceedings.71-5.pdf308.3Kb PDF Öffnen

Haben Sie fehlerhafte Angaben entdeckt? Sagen Sie uns Bescheid: Feedback abschicken

Mehr Information

ISBN: 3-88579-400-4
ISSN: 1617-5468
Datum: 2005
Sprache: en (en)
Typ: Text/Conference Paper
Sammlungen

Zur Langanzeige