Results 241 to 250 of about 5,627 (286)

A practitioner's guide to using data on private equity hospital acquisitions. [PDF]

Health Aff Sch
Kim S, Naslund M, Wang X, Hasan A, Huang H, Hwang HG, La Forgia A, League R, McDevitt RC, Yang KK.   +9 more
europepmc   +1 more source

Different cadaver astigmatan mites (Arthropoda: Acari) are designed to bite flesh differently. [PDF]

Naturwissenschaften
Bowman CE, Perotti MA.
europepmc   +1 more source

Fast and practical approximate string matching

Information Processing Letters, 1992
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ricardo A. Baeza-Yates, Chris H. Perleberg   +1 more
openaire   +3 more sources

A Randomized Algorithm for Approximate String Matching

Algorithmica, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mikhail J. Atallah, Frédéric Chyzak, Philippe Dumas 0001   +2 more
core   +3 more sources

Approximate string matching: Investigations with a hardware string comparator

, 1988
Approximate string matching attempts to determine how similar two strings are. An algorithm is developed for determining relative string similarity. An architecture for comparing strings using this algorithm is also developed.
Owolabi, O., Ferguson, J.D.
openaire   +4 more sources

Approximate string matching with gaps.

Nord. J. Comput., 2002
Summary: We consider several new versions of approximate string matching with gaps. The main characteristic of these new versions is the existence of gaps in the matching of a given pattern in a text. Algorithms are devised for each version and their time and space complexities are stated.
Crochemore, Maxime, Iliopoulos, Costas S., Makris, C., Rytter, Wojciech, Tsakalidis, A., Tsichlas, K.   +5 more
openaire   +3 more sources

Some of the next articles are maybe not open access.

Related searches:

Approximate string matching with suffix automata

Algorithmica, 1993
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Esko Ukkonen, Derick Wood, Ukkonen Esko   +2 more
exaly   +2 more sources

Approximate String Matching

ACM Computing Surveys, 1980
Approximate matching of strings is reviewed with the aim of surveying techniques suitable for finding an item in a database when there may be a spelling mistake or other error in the keyword. The methods found are classified as either equivalence or similarity problems. Equivalence problems are seen to be readily solved using canonical forms.
Patrick A. V. Hall, Geoff R. Dowling
openaire   +1 more source

Faster Approximate String Matching

Algorithmica, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ricardo A. Baeza-Yates, Gonzalo Navarro 0001   +1 more
openaire   +2 more sources