Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, July 15, 2004, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Moritz Maaß (TU München)

An Average-Case Analysis of Trie Searching with Mismatches

We present an analysis of the average-case number of comparisons when searching a pattern P in a trie of n string X1,...,Xn allowing D errors which occur between two characters with probability p under a memoryless uniform model. Using techniques from complex analysis, we get exact asymptotics for the case of a constant number D=O(1) of errors. If the number of errors D is allowed to grow with the database size, we get a threshold up to where using a trie is more efficient than searching the database naively string by string. Our results can be applied for any comparison-based error model, for instance, mismatches (Hamming distance), don't cares, or geometric character distances.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login