Fast String Matching using an n-gram Algorithm

Fast String Matching using an n-gram Algorithm (1994)

by Jong Yong Kim , John Shawe-taylor

Venue:	Software - Practice and Experience
Citations:	11 - 0 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Fast String Matching using an n-gram Algorithm	user correction - Legacy Corrections
AUTHOR NAME	Jong Yong Kim	user correction - Legacy Corrections
AUTHOR NAME	John Shawe-taylor	user correction - Legacy Corrections
AUTHOR AFFIL	; Department of Computer Science, Royal Holloway and Bedford New College, University; SUMMARY	user correction - Legacy Corrections
AUTHOR ADDR	; of London, Egham, Surrey TW20 0EX, U.K. (email: john�dcs.rhbnc.ac.uk)	user correction - Legacy Corrections
ABSTRACT	This paper investigates the performance of the new algorithm on such data and compares it with other known algorithms. The results are very encouraging, suggesting that the expected running time theoretical results for ergodic sequences provide a very good estimate of the algorithm's performance on DNA sequences. In fact the algorithm provides its most striking performance on longer pattern strings and small size of alphabet	user correction - Legacy Corrections
YEAR	1994	INFERENCE
VENUE	Software - Practice and Experience	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	79--83	INFERENCE
VOLUME	24	INFERENCE
CITATIONS	13 found	ParsCit 1.0