@inproceedings{9644bdaf604544a8a014b91fab2109da,
title = "Trie-based data structures for sequence assembly",
abstract = "We investigate the application of trie-based data structures, suffix trees and suffix arrays in the problem of overlap detection in fragment assembly. Both data structures are theoretically and experimentally analyzed on speed and space. By using heuristics, we can greatly reduce the calls to the time-consuming dynamic programming, and have improved the speed of overlap detection up to 1,000 times with high accuracy in our collaborative DNA sequencing with Brookhaven National Laboratory. We also studied the problem of approximating maximum space savings in tries structures for unification factoring in logic programming, which is proved to be hard.",
author = "Ting Chen and Skiena, \{Steven S.\}",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1997.; 8th Annual Symposium on Combinatorial Pattern Matching, CPM 1997 ; Conference date: 30-06-1997 Through 02-07-1997",
year = "1997",
doi = "10.1007/3-540-63220-4\_61",
language = "English",
isbn = "9783540632207",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "206--223",
editor = "Alberto Apostolico and Alberto Apostolico and Jotun Hein",
booktitle = "Combinatorial Pattern Matching - 8th Annual Symposium, CPM 1997, Proceedings",
}