Combinatorial Pattern Matching: ... Annual SymposiumSpringer-Verlag, 2005 - Combinatorial analysis |
From inside the book
Results 1-3 of 40
Page 315
... vertex cover for GB ( a vertex cover for GB is a subset of vertices incident on all edges ) . Since the graph GB is bipartite , a minimum vertex cover can be easily derived from a maximum matching , which can be computed in O ( m ' √n ) ...
... vertex cover for GB ( a vertex cover for GB is a subset of vertices incident on all edges ) . Since the graph GB is bipartite , a minimum vertex cover can be easily derived from a maximum matching , which can be computed in O ( m ' √n ) ...
Page 350
... vertex in T [ u ] – T [ v ] . For a tree T and a vertex u of T , the height of T , the height of T [ u ] , and the height of T – T [ u ] are denoted by height ( T ) , heightт ( u ) , and height ( u ) , respectively . For two vertices u ...
... vertex in T [ u ] – T [ v ] . For a tree T and a vertex u of T , the height of T , the height of T [ u ] , and the height of T – T [ u ] are denoted by height ( T ) , heightт ( u ) , and height ( u ) , respectively . For two vertices u ...
Page 377
... vertex . For each tree T , we associate a table E ( d , id ) where E ( d , id ) denotes the number of vertices v such that d ( v ) = d and ID ( v ) = id . Since there are O ( 1 ) different signatures , E ( d , id ) consists of O ( d ( T ) ...
... vertex . For each tree T , we associate a table E ( d , id ) where E ( d , id ) denotes the number of vertices v such that d ( v ) = d and ID ( v ) = id . Since there are O ( 1 ) different signatures , E ( d , id ) consists of O ( d ( T ) ...
Contents
Sharper Upper and Lower Bounds for an Approximation Scheme | 1 |
Text Indexing with Errors | 21 |
Succinct Suffix Arrays Based on RunLength Encoding | 45 |
Copyright | |
20 other sections not shown
Other editions - View all
Common terms and phrases
algorithm alignment alphabet Apostolico approximate automaton Bioinformatics bits bound breakpoint Burrows-Wheeler transform c-token character column complexity Computer Science consensus PQ tree consider constraints construction Corasick corresponding Crochemore data structure defined Definition denote DFTDP DIST DNA sequences dynamic programming edges edit distance efficient encoding errors example exons function gene genome given graph Hamming distance implementation input integer interval label Lemma length linear LNCS mass matching problem Max-SNP maximal median minimal consensus PQ mismatches motif multiset node O(n log obtained occurrences optimal output p₁ pair Parsing path pattern matching peak permutations polynomial position PQ tree prefix prefix-free preprocessing Proc Proof protein regular expression rigid subsequence S₁ score Section shift distance space spin images Springer-Verlag string matching substring suffix array suffix tree term tree Theorem trie variable vector vertex WDWG words