Average-optimal multiple approximate string matching

@misc{citeulike:158406, abstract = {We present a new algorithm for multiple approximate string matching, based on an extension of the optimal (on average) single-pattern approximate string matching algorithm of Chang and Marr. Our algorithm inherits the optimality and is also competitive in practice.}, author = {Fredriksson, K. and Navarro, G. }, citeulike-article-id = {158406}, keywords = {approximate, matching, string}, posted-at = {2005-04-11 15:40:48}, priority = {3}, title = {Average-optimal multiple approximate string matching}, url = {http://citeseer.ist.psu.edu/fredriksson03averageoptimal.html}, year = {2003} }

TY - GEN ID - citeulike:158406 L3 - citeulike-article-id:158406 TI - Average-optimal multiple approximate string matching N2 - We present a new algorithm for multiple approximate string matching, based on an extension of the optimal (on average) single-pattern approximate string matching algorithm of Chang and Marr. Our algorithm inherits the optimality and is also competitive in practice. KW - approximate KW - matching KW - string AU - Fredriksson, K AU - Navarro, G PY - 2003/// UR - http://citeseer.ist.psu.edu/fredriksson03averageoptimal.html ER -