Abstract. This paper deals with the problem of solving efficiently structured CSPs. It is well known that (hyper)tree-decompositions offer the best approaches from a theoretical v...
Abstract. In this paper we define a new similarity measure, the nonbreaking similarity, which is the complement of the famous breakpoint distance between genomes (in general, betw...
Zhixiang Chen, Bin Fu, Jinhui Xu, Bo-Ting Yang, Zh...
Abstract. Graph pattern matching is a central application in many fields. In various areas, the structure of the pattern can only be approximated and exact matching is then too ac...
Abstract. Semantic matching of schemas in heterogeneous data sharing systems is time consuming and error prone. Existing mapping tools employ semi-automatic techniques for mapping ...
While algorithmic DNA self-assembly is, in theory, capable of forming complex patterns, its experimental demonstration has been limited by significant assembly errors. In this pa...