Abstract. k-ary trees are a fundamental data structure in many textprocessing algorithms (e.g., text searching). The traditional pointer-based representation of trees is space cons...
Background: Currently there is a strong need for methods that help to obtain an accurate description of protein interfaces in order to be able to understand the principles that go...
Joan Teyra, Andreas Doms, Michael Schroeder, M. Te...
Background: The Affymetrix™ technology is nowadays a well-established method for the analysis of gene expression profiles in cancer research studies. However, changes in gene ex...
Davide Rambaldi, Barbara Felice, Viviane Praz, Phi...
Keyword queries enjoy widespread usage as they represent an intuitive way of specifying information needs. Recently, answering keyword queries on graph-structured data has emerged ...
Thanh Tran, Haofen Wang, Sebastian Rudolph, Philip...
Accurately representing higher-order singularities of vector fields defined on piecewise linear surfaces is a non-trivial problem. In this work, we introduce a concise yet complet...
Wan-Chiu Li, Bruno Vallet, Nicolas Ray, Bruno L...