Titlebook: Combinatorial Pattern Matching; 4th Annual Symposium Alberto Apostolico,Maxime Crochemore,Udi Manber Conference proceedings 1993 Springer-V

analogous

Perceive

chisel

https://doi.org/10.1007/BFb0029791Algorithmik; Combinatorics; Computational Biology; Kombinatorik; Mustererkennung; Pattern Matching; Perfor

抵消

978-3-540-56764-6Springer-Verlag Berlin Heidelberg 1993

radiograph

草率女

放縱

A new editing based distance between unordered labeled trees,matching is also considered. We present algorithms solving these problems in sequential time ..| × |..| × max{deg(..), deg (T.)} × log.(..), deg (T.)})). Our previous result shows that computing the editing distance between unordered labeled trees is NP-complete.

致詞

Conference proceedings 1993.Combinatorial pattern matching addresses issues of searchingandmatching of strings and more complicated patterns suchas trees, regularexpressions, extended expressions, etc.The goal is to derive nontrivialcombinatorial propertiesfor such structures and then to exploit theseproperties inorder to ach

A簡潔的

Tight comparison bounds for the string prefix-matching problem,er we study the exact complexity of the string prefix-matching problem in the deterministic sequential comparison model. Our bounds do not account for comparisons made in a pattern preprocessing step. The following results are presented:

Bereavement

On the worst-case behaviour of some approximation algorithms for the shortest common supersequence mal in the worst case. The corresponding bounds proved for the obvious Greedy algorithm are (4. + 17)/27 and (.?1)/e. Even for a binary alphabet, no constant performance guarantee is possible for either algorithm, in contrast with the guarantee of 2 provided by a trivial algorithm in that case.