Sciweavers

IPL
2008
114views more  IPL 2008»
13 years 10 months ago
Faster algorithms for guided tree edit distance
The guided tree edit distance problem is to find a minimum cost series of edit operations that transforms two input forests F and G into isomorphic forests F and G such that a thi...
Dekel Tsur
STRINGOLOGY
2004
14 years 6 days ago
A Note on Bit-Parallel Alignment Computation
Abstract. The edit distance between strings A and B is defined as the minimum number of edit operations needed in converting A into B or vice versa. Typically the allowed edit oper...
Heikki Hyyrö
FOIKS
2008
Springer
14 years 12 days ago
Visibly Pushdown Transducers for Approximate Validation of Streaming XML
Visibly Pushdown Languages (VPLs), recognized by Visibly Pushdown Automata (VPAs), are a nicely behaved family of contextfree languages. It has been shown that VPAs are equivalent ...
Alex Thomo, Srinivasan Venkatesh, Ying Ying Ye
SIGMOD
2009
ACM
140views Database» more  SIGMOD 2009»
14 years 5 months ago
Robust web extraction: an approach based on a probabilistic tree-edit model
On script-generated web sites, many documents share common HTML tree structure, allowing wrappers to effectively extract information of interest. Of course, the scripts and thus ...
Nilesh N. Dalvi, Philip Bohannon, Fei Sha
WALCOM
2010
IEEE
230views Algorithms» more  WALCOM 2010»
14 years 5 months ago
Comparing RNA Structures with Biologically Relevant Operations Cannot Be Done without Strong Combinatorial Restrictions
Abstract. Arc-annotated sequences are useful for representing structural information of RNAs and have been extensively used for comparing RNA structures in both terms of sequence a...
Guillaume Blin, Sylvie Hamel, Stéphane Vial...