We present a simple objective function that when optimized yields accurate solutions to both decipherment and cognate pair identification problems. The objective simultaneously s...
Signal nding pattern discovery in unaligned DNA sequences is a fundamental problem in both computer science and molecular biology with important applications in locating regulator...
"This is a standard senior-level algorithms class required of every computer science undergraduate and graduate student at the University of Illinois."
The definition of combinatory categorial grammar (CCG) in the literature varies quite a bit from author to author. However, the differences between the definitions are important i...
We show that every NP problem is polynomially equivalent to a simple combinatorial problem: the membership problem for a special class of digraphs. These classes are defined by me...