Author:
Crochemore Maxime,Désarménien Jacques,Perrin Dominique
Subject
General Computer Science,Theoretical Computer Science
Reference11 articles.
1. H. Bannai, S. Inenaga, A. Shinohara, M. Takeda, Inferring strings from graphs and arrays, in: B. Rovan, P. Vojtáš (Eds.), Mathematical Foundations of Computer Science 2003, Lecture Notes in Computer Science, Vol. 2747, Springer, Berlin, 2003.
2. M. Burrows, D.J. Wheeler, A block sorting data compression algorithm, Tech. Report, Digital System Research Center, 1994.
3. Jewels of Strigology;Crochemore,2002
4. Words over an ordered alphabet and suffix permutations;Duval;Theor. Inform. Appl.,2002
5. Counting permutations with given cycle structure and descent set;Gessel;J. Combin. Theory Ser. A,1993
Cited by
37 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献