Name
Abstract | ||
|---|---|---|
Words that appear as constrained subsequences in a text-string are considered as possible indicators of the host string structure, hence also as a possible means of sequence comparison and classification. The constraint consists of imposing a bound on the number @w of positions in the text that may intervene between any two consecutive characters of a subsequence. A subset of such @w-sequences is then characterized that consists, in intuitive terms, of sequences that could not be enriched with more characters without losing some occurrence in the text. A compact spatial representation is then proposed for these representative sequences, within which a number of parameters can be defined and measured. In the final part of the paper, such parameters are empirically analyzed on a small collection of text-strings endowed with various degrees of structure. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.tcs.2009.07.017 | Theor. Comput. Sci. |
Keywords | DocType | Volume |
intuitive term,Suffix graph,subsequence composition,small collection,String complexity measures,sequence comparison,possible indicator,consecutive character,final part,representative sequence,Core equivalence classes,Special subsequences,compact spatial representation,possible mean,host string structure,Constrained subsequences | Journal | 410 |
Issue | ISSN | Citations |
43 | Theoretical Computer Science | 1 |
PageRank | References | Authors |
0.35 | 8 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alberto Apostolico | 1 | 1441 | 182.20 |
| Fabio Cunial | 2 | 72 | 9.68 |
| MA HA | 3 | 1 | 0.35 |