Show simple item record

dc.contributor.authorHankins, Richard A.en_US
dc.contributor.authorTata, Sandeepen_US
dc.contributor.authorPatel, Jignesh M.en_US
dc.contributor.authorTian, Yuanyuanen_US
dc.date.accessioned2006-09-11T19:29:13Z
dc.date.available2006-09-11T19:29:13Z
dc.date.issued2005-09en_US
dc.identifier.citationTian, Yuanyuan; Tata, Sandeep; Hankins, Richard A.; Patel, Jignesh M.; (2005). "Practical methods for constructing suffix trees." The VLDB Journal 14(3): 281-299. <http://hdl.handle.net/2027.42/47869>en_US
dc.identifier.issn0949-877Xen_US
dc.identifier.issn1066-8888en_US
dc.identifier.urihttps://hdl.handle.net/2027.42/47869
dc.description.abstractSequence datasets are ubiquitous in modern life-science applications, and querying sequences is a common and critical operation in many of these applications. The suffix tree is a versatile data structure that can be used to evaluate a wide variety of queries on sequence datasets, including evaluating exact and approximate string matches, and finding repeat patterns. However, methods for constructing suffix trees are often very time-consuming, especially for suffix trees that are large and do not fit in the available main memory. Even when the suffix tree fits in memory, it turns out that the processor cache behavior of theoretically optimal suffix tree construction methods is poor, resulting in poor performance. Currently, there are a large number of algorithms for constructing suffix trees, but the practical tradeoffs in using these algorithms for different scenarios are not well characterized.en_US
dc.format.extent1296564 bytes
dc.format.extent3115 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypetext/plain
dc.language.isoen_US
dc.publisherSpringer-Verlagen_US
dc.subject.otherComputer Scienceen_US
dc.subject.otherSequence Matchingen_US
dc.subject.otherDatabase Managementen_US
dc.subject.otherSuffix Tree Constructionen_US
dc.titlePractical methods for constructing suffix treesen_US
dc.typeArticleen_US
dc.subject.hlbsecondlevelPhilosophyen_US
dc.subject.hlbsecondlevelComputer Scienceen_US
dc.subject.hlbtoplevelHumanitiesen_US
dc.subject.hlbtoplevelEngineeringen_US
dc.description.peerreviewedPeer Revieweden_US
dc.contributor.affiliationumUniversity of Michigan, 1301 Beal Avenue, Ann Arbor, MI, 48109-2122, USAen_US
dc.contributor.affiliationumUniversity of Michigan, 1301 Beal Avenue, Ann Arbor, MI, 48109-2122, USAen_US
dc.contributor.affiliationumUniversity of Michigan, 1301 Beal Avenue, Ann Arbor, MI, 48109-2122, USAen_US
dc.contributor.affiliationotherMicroarchitecture Research Lab, Intel Corp., 2200 Mission College Blvd, Santa Clara, CA, 95054, USAen_US
dc.contributor.affiliationumcampusAnn Arboren_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/47869/1/778_2005_Article_154.pdfen_US
dc.identifier.doihttp://dx.doi.org/10.1007/s00778-005-0154-8en_US
dc.identifier.sourceThe VLDB Journalen_US
dc.owningcollnameInterdisciplinary and Peer-Reviewed


Files in this item

Show simple item record