220 search results - page 19 / 44 » tcs 2008 |
TCS
2002
13 years 9 months ago
2002
One of the most basic pattern recognition problems is whether a certain local feature occurs in some linear array to the left of some other local feature. We construct in this art...
TCS
2002
13 years 9 months ago
2002
An operation M which constructs from a given structure M a tree-like structure whose domain consists of the finite sequences of elements of M is considered. A notion of automata r...
TCS
2002
13 years 9 months ago
2002
The concept of pseudorandomness plays an important role in cryptography. In this note, we contrast the notions of complexity-theoretic pseudorandom strings (from algorithmic infor...
TCS
2002
13 years 9 months ago
2002
We investigate Martin's game (as described in Arruda et al. (Eds.), On Random R. E. Sets, Non-Classical Logics, Model Theory and Computability, North-Holland, Amsterdam, 1977...
TCS
2008
13 years 9 months ago
2008
Most genome rearrangements (e.g., reversals and translocations) can be represented as 2-breaks that break a genome at 2 points and glue the resulting fragments in a new order. Mul...