Publications
2009
Pavlos Antoniou Repetitive Structures in Biological Sequences and Applications in High Throughput Technologies. PhD thesis,(submitted December 1st 2008.)
Julien Allali, Pavlos Antoniou, Pascal Ferraro, Costas S. Iliopoulos and Manal Mohamed.Validation and Decomposition of Partially Occluded Images with Holes. (Submitted to the 4-th Iberian Conference on Pattern Recognition and Image Analysis, IbPRIA 2009).
2008
Pavlos Antoniou, Costas S. Iliopoulos, Inuka Jayasekera and Wojciech Rytter. Computing repetitive structures in indeterminate strings. In Proceedings of the 3rd IAPR International Conference on Pattern Recognition in Bioinformatics (PRIB 2008) , Melbourne, Australia, October 2008.
Pavlos Antoniou, Maxime Crochemore, Costas S. Iliopoulos, Inuka Jayasekera and Gad M. Landau. Conservative string covering of indeterminate strings. In Proceedings of the 13th Prague Stringology Conference (PSC 2008), Prague, Czech Republic, September 2008. (Journal version submitted to the International Journal of Foundations of Computer Science)
Pavlos Antoniou, Costas S. Iliopoulos, Inuka Jayasekera, Mohammad Sohel Rahman and Marie France Sagot. Implementation of a swap matching algorithm using a graph theoretic model. In Proceedings of the 2nd Workshop on Algorithms in Molecular Biology (ALBIO 2008), Vienna, Austria, July 2008.
2007
Pavlos Antoniou, Maxime Crochemore, Costas S. Iliopoulos, and Pierre Peterlongo. Application of suffix trees for the acquisition of common motifs with gaps in a set of strings. In Proceedings of the 1st International Conference on Language and Automata Theory and Applications, Tarragona, Spain, March 2007.
2006
Pavlos. Antoniou, Jan Holub, Costas S. Iliopoulos, Borivoj Melichar, and Pierre Peterlongo. Finding common motifs with gaps using finite automata. In Proceedings of the 11th International Conference on Implementation and Application of Automata (CIAA'06), volume 4094 2006, pages 69-77, Taipei, Taiwan, August 2006. Springer Berlin Heidelberg.