Compressed Index for Dictionary Matching with One Error
MetadataShow full item record
Items in KU ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
We want to hear from you! Please share your stories about how Open Access to this item benefits YOU.
Showing items related by title, author, creator and subject.
Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching Read More: http://epubs.siam.org/doi/abs/10.1137/S0097539702402354 Grossi, Roberto; Vitter, Jeffrey (Society for Industrial and Applied Mathematics, 2005)The proliferation of online text, such as found on the World Wide Web and in online databases, motivates the need for space-efficient text indexing methods that support fast string searching. We model this scenario as ...
Constructivist-Based Asynchronous Tutorial to Improve Transfer between Math and Chemistry Domains: Design, Implementation, and Analysis of the Impact of ReMATCH on General Chemistry Course Performance and Confidence Barker, M. Danielle (University of Kansas, 2011-12-31)The two-year implementation of ReMATCH, a web-based math and problem-solving tutorial, in a traditionally arranged general chemistry classroom at the University of Kansas examined the impact of a designed intervention to ...