Name
Abstract | ||
|---|---|---|
We give a linear-time algorithm to reconstruct a finite word w over a finite alphabet A of constant size starting from a finite set of factors of w verifying a suitable hypothesis. We use combinatorics techniques based on the minimal forbidden words, which have been introduced in previous papers. This improves a previous algorithm which worked under the assumption of stronger hypothesis. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1016/j.tcs.2006.03.006 | Theor. Comput. Sci. |
Keywords | DocType | Volume |
stronger hypothesis,finite alphabet A,linear-time algorithm,word assembly,constant size,finite set,suitable hypothesis,previous paper,combinatorics technique,previous algorithm,finite word w | Journal | 359 |
Issue | ISSN | Citations |
1 | Theoretical Computer Science | 9 |
PageRank | References | Authors |
0.66 | 5 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gabriele Fici | 1 | 252 | 30.13 |
| Filippo Mignosi | 2 | 569 | 99.71 |
| Antonio Restivo | 3 | 697 | 107.05 |
| Marinella Sciortino | 4 | 225 | 22.34 |