This paper describes an approach for representing and manipulating sequences in description logics (DLs). The key idea is to represent sequences using sux trees, then represent t...
: Common sub-expression elimination (CSE) serves as a useful optimization technique in the synthesis of arithmetic datapaths described at RTL. However, CSE has a limited potential ...
We derive a new generalization of lowest common ancestors (LCAs) in dags, called the lowest single common ancestor (LSCA). We show how to preprocess a static dag in linear time su...
The article surveys parameterized algorithms and complexities for computational tasks on biopolymer sequences, including the problems of longest common subsequence, shortest commo...
This contribution reports on ongoing collaborative research at the University of Stanford, Department of Psychology, and the University of Hamburg, Department for Informatics. Ext...