9 search results - page 1 / 2 » Reconstructing strings from random traces |
SODA
2004
ACM
13 years 6 months ago
2004
ACM
We are given a collection of m random subsequences (traces) of a string t of length n where each trace is obtained by deleting each bit in the string with probability q. Our goal ...
MST
2006
13 years 4 months ago
2006
The board game FragmindTM poses the following problem: The player has to reconstruct an (unknown) string s over the alphabet . To this end, the game reports the following informati...
CEC
2005
IEEE
13 years 10 months ago
2005
IEEE
The evolution of music, from random note strings to certain “pleasant” note sequences, is traced in a multi-agent computational model. A community of agents, with some musical ...
ALIFE
2004
13 years 4 months ago
2004
Phylogenetic trees group organisms by their ancestral relationships. There are a number of distinct algorithms used to reconstruct these trees from molecular sequence data, but dif...
ALT
2008
Springer
14 years 1 months ago
2008
Springer
Abstract. Classical probability theory considers probability distributions that assign probabilities to all events (at least in the finite case). However, there are natural situat...