network profile
| bio | website | |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 7 months |
| seen | Oct 7 '12 at 19:41 | |
| stats | profile views | 0 |
|
Oct 7 |
comment |
Is there research similar to Stringology, but with sequences of sets? I mean trying again with editing my question, I mean that! phew |
|
Oct 7 |
revised |
Is there research similar to Stringology, but with sequences of sets? added 39 characters in body; added 7 characters in body |
|
Oct 7 |
revised |
Is there research similar to Stringology, but with sequences of sets? added 39 characters in body; added 7 characters in body |
|
Oct 7 |
revised |
Is there research similar to Stringology, but with sequences of sets? added 39 characters in body; added 7 characters in body |
|
Oct 7 |
comment |
Is there research similar to Stringology, but with sequences of sets? I probably should just say what I need it for then. I needed results of the type: Given a sequence of sets of length n with an alphabet of size a, what are the highest/average number of different subset strings possible. (and try again with the question^^) |
|
Oct 7 |
awarded | Editor |
|
Oct 7 |
revised |
Is there research similar to Stringology, but with sequences of sets? added 249 characters in body |
|
Oct 7 |
comment |
Is there research similar to Stringology, but with sequences of sets? Oh, I'm sorry. I think I wasn't explicit, I edited the question. I am rather certain that (at least for the research I found) the results can not be copied over with that substring notion in mind. |
|
Oct 5 |
awarded | Student |
|
Oct 4 |
asked | Is there research similar to Stringology, but with sequences of sets? |
