๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Simple and Improved Parameterized Algorithms for

โœ Scribed by Mingyu Xiao


Publisher
Springer
Year
2009
Tongue
English
Weight
363 KB
Volume
46
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


An Improved Parameterized Algorithm for
โœ Jianer Chen; Yang Liu; Songjian Lu ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› Springer ๐ŸŒ English โš– 319 KB
Parameterized Pattern Matching: Algorith
โœ Brenda S. Baker ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 416 KB

The problem of finding sections of code that either are identical or are related by the systematic renaming of variables or constants can be modeled in terms of parameterized strings ( p-strings) and parameterized matches ( p-matches). P-strings are strings over two alphabets, one of which represent