A. Aho, D. Hirschberg, and J. D. Ullman, Bounds on the complexity of the longest common subsequence problem, 15th Annual Symposium on Switching and Automata Theory (swat 1974), pp.1-12, 1976.
DOI : 10.1109/SWAT.1974.7

[. A. Alexandrov, M. F. Ionescu, K. E. Schauser, and C. Scheiman, LogGP, Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures , SPAA '95, pp.95-105, 1995.
DOI : 10.1145/215399.215427

M. [. Apostolico, L. Atallah, S. Larmore, and . Mcfaddin, Efficient Parallel Algorithms for String Editing and Related Problems, SIAM Journal on Computing, vol.19, issue.5, pp.968-988, 1990.
DOI : 10.1137/0219066

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

S. [. Apostolico, C. Browne, and . Guerra, Fast linear-space computations of longest common subsequences, Theoretical Computer Science, vol.92, issue.1, pp.3-17, 1992.
DOI : 10.1016/0304-3975(92)90132-Y

E. [. Alves, F. Cáceres, S. W. Dehne, and . Song, Parallel dynamic programming for solving the string editing problem on a CGM/BSP, Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures , SPAA '02, pp.275-281, 2002.
DOI : 10.1145/564870.564916

E. [. Alves, F. Cáceres, S. W. Dehne, and . Song, A Parallel Wavefront Algorithm for Efficient Biological Sequence Comparison, International Conference of Computational Science and Its Applications (ICCSA'03), pp.249-258, 2003.
DOI : 10.1007/3-540-44843-8_27

E. [. Alves, S. W. Cáceres, and . Song, A BSP/CGM algorithm for the all-substrings longest common subsequence problem, Proceedings International Parallel and Distributed Processing Symposium, 2003.
DOI : 10.1109/IPDPS.2003.1213150

H. Alt, T. Hagerup, K. Mehlhorn, and F. P. Preparata, Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones, SIAM Journal on Computing, vol.16, issue.5, pp.808-835, 1987.
DOI : 10.1137/0216053

]. A. Aho90 and . Aho, Algorithms for Finding Patterns in Strings Handbook of Theoretical Computer Science, pp.255-300, 1990.

J. [. Aho, J. D. Hopcroft, and . Ullman, The Design and Analysis of Computer Algorithms, 1974.

]. S. Akl85, Parallel Sorting Algorithms, 1985.

]. S. Akl89, The Design and Analysis of Parallel Algorithms, 1989.

]. S. Akl90, Parallel Synergy or Can a Parallel Computer Be More Efficient Than the Sum of Its Parts ?, pp.90-285, 1990.

A. [. Apostolico and . Negro, A Structure for the Statistics of All Substrings of a Textstring With or Without Overlap, World Conf. on Math. at Science of Man, 1982.

A. [. Apostolico and . Negro, Systolic Algorithms for String Manipulations, IEEE Transactions on Computers, vol.33, issue.4, pp.361-364, 1984.
DOI : 10.1109/TC.1984.1676442

F. [. Apostolico and . Preparata, Optimal off-line detection of repetitions in a string, Theoretical Computer Science, vol.22, issue.3, pp.297-315, 1983.
DOI : 10.1016/0304-3975(83)90109-3

P. Bose, A. Chan, F. Dehne, and M. Latzel, Coarse grained parallel maximum matching in convex bipartite graphs, Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing. IPPS/SPDP 1999, pp.125-129, 1999.
DOI : 10.1109/IPPS.1999.760446

]. J. Ber79 and . Berstel, Transductions and Context-free Languages, 1979.

]. J. Ber81 and . Berstel, Mots de Fibonacci, pp.57-78, 1981.

]. J. Ber92 and . Berstel, Axel Thue's Work on Repetitions in Words, Conf. on Formal Power Series and Algebric Combinatorics, 1992.

J. [. Boyer and . Moore, A fast string searching algorithm, Communications of the ACM, vol.20, issue.10
DOI : 10.1145/359842.359859

]. C. Bra80 and . Braunholtz, Solution to Problem 5030, BS93] J. Berstel and P. Séébold. A Characterization of Overlap-free Morphisms, pp.558-567, 1980.

F. [. Chan and . Dehne, A NOTE ON COARSE GRAINED PARALLEL INTEGER SORTING, Parallel Processing Letters, vol.09, issue.04, pp.533-538, 1999.
DOI : 10.1142/S0129626499000499

F. E. Caceres, A. Dehne, P. Ferreira, I. Flocchini, A. Rieping et al., Efficient Parallel Graph Algorithms For Coarse Grained Multicomputers and BSP. Algorithmica, pp.183-200, 2002.

C. [. Cérin, J. F. Dufourd, and . Myoupo, A Linear systolic Architecture for the Longest Increasing Subsequence Problem, ICCS'92, 1992.

C. [. Cérin, J. F. Dufourd, and . Myoupo, An efficient parallel solution for the longest increasing subsequence problem, Proceedings of ICCI'93: 5th International Conference on Computing and Information, pp.200-224, 1993.
DOI : 10.1109/ICCI.1993.315375

]. D. Ckp-+-93, R. Culler, D. Karp, A. Patterson, K. E. Sahay et al., Logp : Towards a realistic model of computation, th ACM SIGPLAN Symp. on Principles and Practises of Parallel Programming, pp.1-12, 1993.

C. [. Cormen, R. L. Leiserson, and . Rivest, Introduction to Algorithms, pp.314-320, 1990.

]. J. Cms99a, J. F. Carle, D. Myoupo, and . Semé, All-to-all broadcasting algorithms on honeycomb networks and applications, Parallel Processing Letters, vol.9, pp.539-550, 1999.

]. J. Cms99b, J. F. Carle, D. Myoupo, and . Semé, Star-honeycomb meshes and tori : Topological properties, communication algorithms, and ring embedding, OPODIS'99, 1999.

]. M. Cro81 and . Crochemore, An optimal algorithm for computing the repetitions in a word, Information Processing Letters, vol.12, issue.5, pp.244-250, 1981.

]. M. Cro83 and . Crochemore, Recherche linéaire d' un carré dans un mot, C. R. Acad. Sci. (série I), vol.296, pp.781-784, 1983.

]. M. Cro84 and . Crochemore, Optimal Factor Transducers, NATO Advanced Research Workshop On Combi. Algo. on Words, 1984.

]. M. Cro86 and . Crochemore, Transducers and Repetitions, Theoretical Computer Science, vol.45, pp.63-86, 1986.

C. [. Cozette, G. Randriamaro, and . Utard, Improving cluster IO performance with remote efficient access to distant device, 27th Annual IEEE Conference on Local Computer Networks, 2002. Proceedings. LCN 2002., pp.629-638, 2002.
DOI : 10.1109/LCN.2002.1181840

URL : https://hal.archives-ouvertes.fr/inria-00072187

C. [. Cozette, G. Randriamaro, and . Utard, READ2 : Put disks at network level, Workshop on Parallel IO, CCGRID'03, pp.698-704, 2003.

]. V. Dan94 and . Dan?-cík, Expected Length of Longest Common Subsequences, 1994.

. Ddd-+-95-]-f, X. Dehne, P. Deng, A. Dymond, A. Fabri et al., A randomized parallel 3d convex hull algorithm for coarse grained multicomputers, Proc. 7th ACM Symp. on Parallel Algorithms and Architectures, pp.27-33, 1995.

F. Dehne, A. Fabri, and A. Rau-chaplin, SCALABLE PARALLEL COMPUTATIONAL GEOMETRY FOR COARSE GRAINED MULTICOMPUTERS, International Journal of Computational Geometry & Applications, vol.06, issue.03, pp.379-400, 1996.
DOI : 10.1142/S0218195996000241

A. [. Diallo, A. Ferreira, S. Rau-chaplin, and . Ubeda, Scalable 2D Convex Hull and Triangulation Algorithms for Coarse Grained Multicomputers, Journal of Parallel and Distributed Computing, vol.56, issue.1, pp.47-70, 1999.
DOI : 10.1006/jpdc.1998.1503

W. [. Du and . Hsu, New Algorithms for the Longest Common Subsequence Problem, Journal of Computer and System Sciences, vol.29, pp.133-152, 1984.

[. Dekeyser and P. Marquet, The Data Parallel Programming Model. chapter Supporting irregular and dynamic computations in data-parallel languages

M. [. Dan?-cík and . Paterson, Longest Common Subsequences, Proc. 11 th Annual Symp. Theor. Aspects Comp. Sci, pp.127-142, 1994.

]. R. Dun90 and . Duncan, A Survey of Parallel Computer Architectures, IEEE Comput, pp.5-16, 1990.

]. J. Duv78 and . Duval, Sur la périodicité des mots, Faculté des Sciences, 1978.

]. M. Eis85 and . Eisler, A Research Report on the Design of an Approximate String Matching Device using the LCS Device Approach, 1985.

]. D. Epp89 and . Eppstein, Efficient Algorithms for Sequence Analysis with Concave and Convexe Gap Costs, 1989.

]. A. Fer96 and . Ferreira, Parallel and communication algorithms for hypercube multiprocessors Chapter Handbook of parallel and Distributed Computing, 1996.

A. Ferreira and I. Guerin-lassous, Algorithmique discrèteparalì ele : le cha??noncha??non manquant. Parallélisme et Répartition, 1998.

]. M. Fly72 and . Flynn, Some computer organizations and their effectiveness, IEEE Trans. on Comp., C, vol.21, pp.948-960, 1972.

]. I. Fra95 and . Fraser, Subsequences and Supersequences of Strings

]. M. Fru92 and . Frumkin, Systolic Computations, 1992.

N. [. Ferreira and . Schabanel, A RANDOMIZED BSP/CGM ALGORITHM FOR THE MAXIMAL INDEPENDENT SET PROBLEM, Parallel Processing Letters, vol.09, issue.03, pp.411-422, 1999.
DOI : 10.1142/S0129626499000384

J. [. Fortune and . Wyllie, Parallelism in random access machines, Proceedings of the tenth annual ACM symposium on Theory of computing , STOC '78, pp.114-118, 1978.
DOI : 10.1145/800133.804339

I. Assefaw-hadish-gebremedhin, J. Guérin-lassous, J. A. Gustedt, and . Telle, Exploration Rapide et Exhaustive des Banques d'ADNGraph Coloring on a Coarse Grained Multiprocessor, 2000.

S. [. Goudreau, K. Rao, T. Lang, T. Suel, and . Tsantilas, Towards efficiency and portability, Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures , SPAA '96, pp.1-12, 1996.
DOI : 10.1145/237502.237503

. [. Guérin-lassous, Algorithmiquesparalì eles de traitement de graphes : une approche basée sur l'analyse expérimentale, 1999.

J. [. Garcia, D. Myoupo, and . Semé, A work-optimal cgm algorithm for the longest increasing subsequence problem, International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA'01), pp.563-569, 2001.

J. [. Garcia, D. Myoupo, and . Semé, A coarse-grained multicomputer algorithm for the longest common subsequence problem, Eleventh Euromicro Conference on Parallel, Distributed and Network-Based Processing, 2003. Proceedings., pp.349-356, 2003.
DOI : 10.1109/EMPDP.2003.1183610

W. [. Gibbons and . Rytter, Efficient Parallel Algorithms, 1988.

]. A. Gra88 and . Gram, Raisonner pour programmer, 1988.

]. D. Gri89 and . Gries, The Science of Programming, 1981.

]. T. Gsa, D. Garcia, and . Semé, A coarse-grained multicomputer algorithm for the detection of repetitions

]. T. Gsb, D. Garcia, and . Semé, A load balancing technique for some coarse-grained multicomputer algorithms

D. [. Garcia and . Semé, A Coarse-Grained Multicomputer Algorithm for the Longest Repeated Suffix Ending at Each Point in a Word, International Conference on Computational Science and its Applications (ICCSA'03), pp.239-248, 2003.
DOI : 10.1007/3-540-44843-8_26

]. D. Gus97 and . Gusfield, Algorithms on Strings, Trees, and Sequences : Computer Science and Computational Biology, 1997.

]. M. Har78 and . Harrison, Introduction to Formal Language Theory, 1978.

]. G. Hed67 and . Hedlund, Remarks on the work of Axel Thue on sequences, Nord. Mat. Tidskr, vol.15, pp.148-150, 1967.

]. D. Hir77 and . Hirschberg, Algorithms for the longest common subsequence problem, Journal of the ACM, vol.24, issue.4, pp.664-675, 1977.

]. K. Hwa93 and . Hwang, Advanced Computer Architecture : Parallelism, Scalability, Programmability, 1993.

K. [. Jacobson and . Vo, Heaviest increasing/common subsequence problems, Proc. 3 rd Annual Symp. CPM, pp.52-66, 1992.
DOI : 10.1007/3-540-56024-6_5

T. [. Keeton, D. A. Anderson, and . Patterson, LogP Quantified : The Case for Low-overhead Local Area Networks, Hot Interconnects III : A Symposium on High Performance Interconnects, 1995.

]. J. Kec91 and . Kececioglu, Exact and Approximate Algorithms for DNA Sequence Reconstruction, 1991.

G. [. Kolpakov and . Kucherov, On maximal repetitions in words, J. Discret. Algorithms, vol.1, issue.1, pp.159-186, 2000.
DOI : 10.1007/3-540-48321-7_31

URL : https://hal.archives-ouvertes.fr/inria-00098852

C. [. Kung and . Leiserson, Algorithms for VLSI Processor Arrays, Proc. SIAM Sparse Matrix Proc, pp.256-282, 1978.

S. [. Kung, S. N. Lo, J. N. Jean, and . Hwang, Wavefront Array Processors-Concept to Implementation, Computer, vol.20, issue.7, pp.18-33, 1987.
DOI : 10.1109/MC.1987.1663617

N. [. Kayambayashi, S. Nakatsu, and . Yajima, A Longest Algorithm Suitable for Similar Text String, Acta Informatica, vol.18, pp.171-179, 1982.

K. [. Kim, . [. Park, V. Karp, and . Ramachandran, Fully Scalable Fault-Tolerant Simulations for BSP and CGM, Journal of Parallel and Distributed Computing, vol.60, issue.12, pp.1531-1560, 1990.
DOI : 10.1006/jpdc.2000.1659

]. H. Kun80a and . Kung, The Structure of Parallel Algorithms, Advances in Comp, vol.19, pp.65-112, 1980.

]. H. Kun80b, . Y. Kungkun84-]-s, and . Kung, Why Systolic Architectures Wavefront Array Processor : Langage, Architecture and Applications, IEEE Comput. IEEE Trans. Comp, vol.15, issue.1, pp.37-46, 1980.

]. D. Lav89 and . Lavenier, MicMacs : un Réseau Systolique pour le Traitement de Cha??nesCha??nes de Caractères, Univ. Rennes, vol.1, 1989.

]. D. Lav93 and . Lavenier, An Integrated 2D Systolic Array for Spelling Correction, Integration : The VLSI J, vol.15, 1993.

]. J. Lee93 and . Leeuwen, Handbook of Theoretical Computer Science, 1993.

]. F. Lei91 and . Leighton, Parallel Algorithms and Architectures : Arrays -Trees-Hypercube, 1991.

I. Guérin, L. , and J. Gustedt, List Ranking on a Coarse Grained Multiprocessor, 1999.

H. [. Lu and . Lin, Parallel Algorithms for the Longest Common Subsequence Problem, IEEE Transactions on Computers, vol.5, issue.8, pp.835-848, 1994.

T. [. Lefebvre and . Lecroq, Computing repeated factors with a factor oracle, Proceedings of the 11th Australasian Workshop On Combinatorial Algorithms, pp.145-158, 2000.

G. [. Lecroq, J. F. Luce, and . Myoupo, A faster linear systolic algorithm for recovering a longest common subsequence, Information Processing Letters, vol.61, issue.3, pp.61129-136, 1997.
DOI : 10.1016/S0020-0190(97)00011-2

J. [. Luce and . Myoupo, Efficient Parallel Computing of a Longest Common Subsequence of Three Strings, 8th SIAM Conf. Parall. Proc. Sci. Comp, 1997.

J. [. Lecroq, D. Myoupo, and . Semé, Exact computations of the longest repeated suffix ending at each point in a word, Proceedings of the 17th International Conference on Computers and Their Applications, pp.18-21, 2002.

]. D. Lop87 and . Lopresti, Discounts for Dynamic Programming with Applications in VLSI Processor Arrays, 1987.

]. M. Lot97 and . Lothaire, Combinatorics on Words, 1997.

I. Guérin, L. , and E. Thierry, Generating Random Permutations in the Framework of Parallel Coarse Grained Models, 2000.

]. G. Luc97 and . Luce, Algorithmique systolique pour leprobì eme du plus long sous-mot commun et implémentation sur un réseau de Transputeurs, 1997.

W. [. Löwe, J. Zimmermann, and . Eisenbiegler, On Linear Schedules of Tasks Graphs on Generalized LogP-Machines, Europar'97, pp.895-904, 1997.

]. U. Man89 and . Manber, Introduction to Algorithms, a creative approach, 1989.

L. [. Mead and . Conway, Introduction to VLSI Systems, 1980.

]. J. Bibliographie-[-mis78 and . Misra, A Technique of Algorithm Construction on Sequence, IEEE Trans. Software Engineering, SE, vol.4, issue.1, pp.65-69, 1978.

R. [. Main and . Lorentz, An O(n log n) algorithm for finding all repetitions in a string, Journal of Algorithms, vol.5, issue.3, 1979.
DOI : 10.1016/0196-6774(84)90021-X

R. [. Main and . Lorentz, Linear Time Recognition of Square-free Strings, NATO Advanced Research Workshop on Combi. Algo. on Words, 1984.

]. D. Mol93 and . Moldovan, Parallel Processing : From Applications to Systems, 1993.

V. [. Morris and . Pratt, A linear pattern-matching algorithm, Report, vol.40, 1970.

M. [. Masek and . Paterson, A faster algorithm computing string edit distances, Journal of Computer and System Sciences, vol.20, issue.1, pp.18-31, 1980.
DOI : 10.1016/0022-0000(80)90002-1

URL : http://doi.org/10.1016/0022-0000(80)90002-1

D. [. Myoupo and . Semé, Topological properties and broadcasting algorithms on X-mesh and X-torus with applications, International Journal on Computers and their Applications, vol.7, issue.2, pp.104-110, 1999.

[. Myoupo and A. Wabbi, Improved linear systolic algorithms for substring statistics, Information Processing Letters, vol.61, issue.5, pp.253-258, 1997.
DOI : 10.1016/S0020-0190(97)00025-2

]. J. New66 and . Von-newmann, Theory of Self Reproducing Automata, 1966.

[. Quinton, F. Fogelman, and Y. Robert, Automata Networks in Computer Science, chapterThe systematic design of systolic arrays, 1987.

[. Quinton, Y. G. Robertran87-]-a, and . Ranade, Algorithmes et Architectures Systoliques How to Emulate Shared Memory, Proceedings of the 28th Annual Symposium on Fondations of Computer Science Tchuente. A Systolic Array for the Longest Common Subsequence Problem. IPL, pp.185-194191, 1985.

]. W. Ryt80 and . Rytter, A correct preprocessing algorithm for boyer-moore string searching

]. R. Sch96 and . Scheihing, Combinatorial Problems in Strings, 1996.

]. P. Séé91 and . Séébold, Fibonacci Morphisms and Sturmian Words, Theor. Comp. Sci, vol.88, pp.365-384, 1991.

]. D. Sem99a and . Semé, Algorithmiqueparalì ele pour lesprobì emes de reconnaissance de formes et de motifs sur les modèles systolique et BSR, 1999.

]. D. Sem99b and . Semé, An Efficient Algorithm on the BSR-Based Parallel Architecture for the k-LCS Problem, Proc. of the Intern. Conf. on Paral. and Distr. Process

J. [. Sankoff, Time Warps, String Edits, and Macromolecules : The Theory and Practice of Sequence Comparison, 1983.

]. W. Smy00 and . Smyth, Repetitive perhaps, but not boring, Theor. Comput. Sci, vol.249, issue.5, pp.343-355, 2000.

]. L. Sny86 and . Snyder, Type Architectures, Shared Memory and the Corollary of Modest Potential, Annual Review of Computer Science, vol.1, pp.289-317, 1986.

]. J. Sto88 and . Storer, Data Compression : Methods and Theory [Sto97] I. Stojmenovic. Honeycomb networks : Topological properties and communication algorithms, IEEE Transactions on Parallel and Distributed Systems, vol.8, issue.10, pp.1036-1042, 1988.

M. [. Smith and . Waterman, Mathematical Methods for DNA Sequences, 1989.

]. T. Szy75 and . Szymanski, A Special Case of the Max Common Subsequences Problem, J. Tech. Rep, 1975.