We study caterpillar tree automata [3] that are restricted to enter any subtree at most one time (or k times). We show that, somewhat surprisingly, the deterministic one-visit aut...
Alexander Okhotin, Kai Salomaa, Michael Domaratzki
Abstract. We present a logical approach to graph theoretical learning that is based on using alphabetic substitutions for modelling graph morphisms. A classi ed graph is represente...
Background: Phylogenetic trees are an important tool for representing evolutionary relationships among organisms. In a phylogram or chronogram, the ordering of taxa is not conside...
Francesco Cerutti, Luigi Bertolotti, Tony L. Goldb...
Abstract: An emerging practice in e-commerce systems is to conduct interviews with buyers in order to identify their needs. The goal of such an interview is to determine sets of pr...
We revisit recently proposed algorithms for probabilistic clustering with pair-wise constraints between data points. We evaluate and compare existing techniques in terms of robust...