3604 search results - page 13 / 721 » All Common Subsequences |
AAAI
1997
13 years 9 months ago
1997
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...
DATE
2009
IEEE
14 years 3 months ago
2009
IEEE
: 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 ...
IPL
2010
13 years 6 months ago
2010
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...
CJ
2008
13 years 8 months ago
2008
The article surveys parameterized algorithms and complexities for computational tasks on biopolymer sequences, including the problems of longest common subsequence, shortest commo...
KI
2002
Springer
13 years 8 months ago
2002
Springer
This contribution reports on ongoing collaborative research at the University of Stanford, Department of Psychology, and the University of Hamburg, Department for Informatics. Ext...