Timeline for Reconstructing an ordering of a multiset from its consecutive submultisets
Current License: CC BY-SA 2.5
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:58 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
| Mar 10, 2017 at 9:42 | history | edited | CommunityBot |
replaced http://eqnets.files.wordpress.com/ with https://eqnets.files.wordpress.com/
|
|
| Feb 3, 2010 at 2:11 | vote | accept | Rob Grey | ||
| Feb 3, 2010 at 2:10 | vote | accept | Rob Grey | ||
| Feb 3, 2010 at 2:11 | |||||
| Jan 19, 2010 at 15:27 | comment | added | Rob Grey | Steve, got it, thanks that makes sense after more carefully reading your post. | |
| Jan 19, 2010 at 13:35 | comment | added | Steve Huntsman | The sequences in question are arbitrary. I use the term "generalized de Bruijn" to emphasize the connection between sequences and Eulerian paths on certain associated graphs, etc. | |
| Jan 19, 2010 at 12:44 | comment | added | Rob Grey | Steve, thanks so much for your notes! It's going to take me a little bit to go through and understand the argument. I should mention however that I'm most interested in the case where the permutation of the multiset S is a long random sequence rather than a debruijn sequence... | |
| Jan 19, 2010 at 5:25 | comment | added | Steve Huntsman | added some matrix-tree/BEST details in a separate answer. | |
| Jan 19, 2010 at 4:57 | history | edited | Steve Huntsman | CC BY-SA 2.5 |
added 1 characters in body
|
| Jan 19, 2010 at 4:34 | history | answered | Steve Huntsman | CC BY-SA 2.5 |