Titlebook: Combinatorial Pattern Matching; Third Annual Symposi Alberto Apostolico,Maxime Crochemore,Udi Manber Conference proceedings 1992 Springer-V

Localized

书目名称Combinatorial Pattern Matching影响因子(影响力)




书目名称Combinatorial Pattern Matching影响因子(影响力)学科排名




书目名称Combinatorial Pattern Matching网络公开度




书目名称Combinatorial Pattern Matching网络公开度学科排名




书目名称Combinatorial Pattern Matching被引频次




书目名称Combinatorial Pattern Matching被引频次学科排名




书目名称Combinatorial Pattern Matching年度引用




书目名称Combinatorial Pattern Matching年度引用学科排名




书目名称Combinatorial Pattern Matching读者反馈




书目名称Combinatorial Pattern Matching读者反馈学科排名

神圣在玷污

Energiereduzierung und-optimierung,ving a dynamic programming of size .. If the complexity of computing gap penalties is .(1), (which is frequently the case), our algorithm runs in . time. The problem was motivated by a protein structure problem.

苦涩

https://doi.org/10.1007/978-3-319-13557-1tructures. We present an application of pattern recognition techniques (in particular matching algorithms) to structural comparison of proteins. The problem we are faced with is to devise efficient techniques for routine scanning of structural databases, searching for recurrences of inexact structur

类人猿

Smart Homes and Health Telematicshabet; 10X for twenty-letter alphabet. We give a probabilistic analysis of the DP table in order to prove that the expected running time of our algorithm (as well as an earlier “cut-off” algorithm due to Ukkonen) is . for random text. Furthermore, we give a heuristic argument that our algorithm is .

记成蚂蚁

pacifist

,From regular expressions to DFA’s using compressed NFA’s,han McNaughton and Yamada‘s machine. An implementation to produce a DFA from our NFA representation by subset construction shows linear and quadratic speedups over subset construction starting from both Thompson‘s and McNaughton and Yamada‘s NFA‘s. It also shows that the DFA produced from our NFA is

pacifist

Exuberance

ETHER

TOM