Malgré la remarquable unité des principaux composants du monde vivant (ADN, ARN, code génétique), nous ne sommes probablement pas encore assez conscient de toute la diversité des structures génomiques existantes, ni de la diversité des modes d'évolution les générant. En plus des substitutions, insertions et délétions ponctuelles, les génomes évoluent par une multitude de mécanismes tels que réarrangements, transferts horizontaux, pertes de gènes, hybridation, duplications simples, segmentales ou même de génomes entiers. Par la comparaison de génomes, il est possible d'inférer des scénarios d'évolution pour des familles de gènes, des clusters ou des génomes entiers, et de prédire les les charactéristiques des génomes ancestraux. En plus de permettre de documenter l'histoire de l'évolution de la vie sur terre, l'inférence d'histoires évolutives permet de répondre à une multitude de questions biologiques concernant la fonction des gènes et les spécificités génétiques des espèces. Chaque problème, chaque type de mutation (ou combinaison de mutations), nécessite une modélisation spécifique et donne lieu à des développements algorithmiques, combinatoires, statistiques, mathématiques différents. C'est à ces problèmes que nous nous consacrons.

• FullSynseth: Syntenic Reconciliation of a Set of Consistent Gene Trees
  M. Gascon, M. Delabre and N. El-Mabrouk
  Theory of Computing Systems , Vol. 70, Article number 8., 2026.
  

• Communiqué de presse : Résoudre les mystères du code génétique
Fonds de recherche du Québec,17 septembre 2024.

• Simultaneously Building and Reconciling a Synteny Tree
  M. Gascon, M. Delabre and N. El-Mabrouk
  International Symposium on String Processing and Information Retrieval (SPIRE)
  Lecture Notes in Computer Science (LNCS), Vol. 14899, p. 127-142, 2024.
  

• Synesth: Comprehensive Segmental Reconciliation with Unsampled Lineage
  M. Delabre and N. El-Mabrouk
  Algorithms, Vol. 17, Num. 5, p. 186 (16 pages), 2024.
  

• On the Complexity of Non-Binary Tree Reconciliation with Endosymbiotic Gene Transfer
  M. Gascon and N. El-Mabrouk
  Algorithms for Molecular Biology, Vol. 18, Num. 9, 2023.
  

• MUL-Tree pruning for consistency and optimal reconciliation - Complexity and algorithms
  M. Gascon, R. Dondi and N. El-Mabrouk
  Theoretical computer science, Vol. 937, pp. 22-38, 2022.
  

• A linear time solution to the Labeled Robinson-Foulds Distance problem
  S. Briand, C. Dessimoz, N. El-Mabrouk and Y. Nevers
  Systematic Biology, Vol 71, Issue 6, pp. 1391-1403, 2022.
  

• Non-binary Tree Reconciliation with Endosymbiotic Gene Transfer (preview)
  M. Gascon and N. El-Mabrouk
  Workshop on Algorithms in Bioinformatics (WABI), September 2022
  

• Reconciliation with Segmental Duplication, Transfer, Loss and Gain (preview)
  M. Delabre, Y. Anselmetti and N. El-Mabrouk
  RECOMB-CG, LNCS, Vol. 13234, pp. 124-145, Springer, 2022
  

• Complexity and Algorithms for MUL-Tree Pruning
  M. Gascon, R. Dondi and N. El-Mabrouk
  IWOCA , LNCS, Vol. 12757, pp 324\--339, 2021
  

• Gene Tree and Species Tree Reconciliation with Endosymbiotic Gene Transfer
  Y. Anselmetti, N. El-Mabrouk, M. Lafond and A. Ouangraoua
  Bioinformatics , Vol. 37 (Suppl. 1), Pages i120-i132, July 2021
  

• Predicting the evolution of syntenies - An algorithmic review
  N. El-Mabrouk
  Algorithms , Vol. 14, Num. 5,p. 152 (23 pages), May 2021.
  

• A linear time solution to the labeled Robinson-Foulds distance problem
  S. Briand, C. Dessimoz, N. El-Mabrouk and Y. Nevers
  Peer Community in Mathematical and Computational Biology , 2020
  
Presented at Evolution and Comparative Genomics COSI, ISMB , 2020

• ISMB 2020 Editorial
  N. El-Mabrouk and D.K. Slonim
  Bioinformatics , Vol. 36, Supp. 1, pp. i1-i2, 2020
  

• A generalized Robinson-Foulds distance for labeled trees
  S. Briand, C. Dessimoz, N. El-Mabrouk, M. Lafond and G. Lobinska
  BMC Genomics , Vol. 21, 2020
  Presented at Asia Pacific Bioinformatics Conference (APBC), 2020
  

• Evolution through segmental duplications and losses : A Super-Reconciliation approach
  M. Delabre, N. El-Mabrouk, K. Huber, M. Lafond, V. Moulton, E. Noutahi and M. Sautie Castellanos
  Algorithms for Molecular Biology , Vol. 15, 2020
  

• Gene family evolution : An algorithmic framework (preview)
  N. El-Mabrouk and E. Noutahi
  Chaper in Bioinformatics and Phylogenetics, Seminal contributions of Bernard Moret,
  Ed. T. Warnow, Computational Biology Series, Springer, 2019
  

• Rapid Genetic Code Evolution in Green Algal Mitochondrial Genomes
  E. Noutahi, V. Calderon, M. Blanchette, N. El-Mabrouk and B.F. Lang
  Molecular Biology and Evolution, Vol. 36, Num. 4, pp 766-783, 2019
  
  Highlight : Recracking the Genetic Code
  Casey McGrath
  Genome Biology and Evolution, Vol. 11, Issue 10, pp 2990-2991, 2019
  

• The complexity of comparing mutiply-labelled trees by extending phylogenetic-tree metrics
  M. Lafond, N. El-Mabrouk, K.T. Huber and V. Moulton
  Theoretical Computer Science , Vol. 760, pp 15-34, 2019
  

• Reconstructing the history of syntenies through Super-Reconciliation (preview)
  M. Delabre, N. El-Mabrouk, K. Huber, M. Lafond, V. Moulton, E. Noutahi and M. Sautie Castellanos
  RECOMB-CG , 2018
  

• GATC: A Genetic Algorithm for gene Tree Construction under the Duplication-Transfer-Loss model of evolution
  E. Noutahi and N. El-Mabrouk.
  BMC Genomics, Vol. 19 (Suppl 2):102, 2018
  Presented at Asia Pacific Bioinformatics Conference (APBC), 2018
  

• Partial Homology Relations - Satisfiability in terms of Di-Cographs
  N. Nojgaard, N. El-Mabrouk. D. Merkle, N. Wieseke and M. Hellmuth
  Lecture Notes in Computer Science, Vol. 10976, Springer, 2018
  Proceedings of COCOON, The 24th International Computing and Combinatorics Conference, 2018
  

• Gene Tree Construction and Correction using SuperTree and Reconciliation
  M. Lafond, C. Chauve, N. El-Mabrouk and A. Ouangraoua
  IEEE/ACM (TCBB), Transactions on Computational Biology and Bioinformatics, Vol. 15, Num. 5, pp. 1560-1570, 2018
  Presented at Asia Pacific Bioinformatics Conference (APBC), 2017
  

• CoreTracker: Accurate codon reassignment prediction, applied to mitochondrial genomes
  E. Noutahi, V. Calderon, M. Blanchette, F.B. Lang and N. El-Mabrouk
  Bioinformatics, Vol. 33, Num. 21, pp. 3331-3339, 2017
  

• A general framework for gene tree correction based on duplication-loss reconciliation (preview)
  N. El-Mabrouk and A. Ouangraoua
  WABI 2017, Algorithms in Bioinformatics, LIPIcs 88, pp. 8:1-8:14, 2017
  

• The nuclear genome of Rhazya stricta and the evolution of alkaloid diversity in a medically relevant clade of Apocynaceae
  J.S.M. Sabir, R.K. Jansen, D. Arasappan, V. Calderon, E. Noutahi, C. Zjeng, S. Park, M.J. Sabir, N.H. Hajrah, M.A. Khiyami, N.A. Baeshen, A.Y. Obaid, A.L. Al-Malki, D. Sankoff, N. El-Mabrouk and T.A. Ruhlman.
  Nature Scientific Reports, Vol.6 (33782), 2016
  
  Highlight : Searching Genomes for New Chemotherapies
  Kristin E. Phillips
  News from the College of Natural Sciences, The University of Texas at Austin
  

• Efficient Gene Tree Correction Guided by Genome Evolution
  E. Noutahi, Magalie Semeria, M. Lafond, J. Seguin, B. Boussau, L. Gueguen, N. El-Mabrouk and E. Tannier
  PloS.One, Vol. 11, Num. 8, e0159559, 2016
  

• Correction of Weighted Orthology and Paralogy Relations - Complexity and Algorithmic results (preview)
  R. Dondi, N. El-Mabrouk and M. Lafond
  Algorithms in Bioinformatics (WABI) , LNCS, Vol. 9838, pp. 121- 136, 2016.

• Efficient Non-binary Gene Tree Resolution with Weighted Reconciliation Cost (preview)
  M. Lafond, E. Noutahi and N. El-Mabrouk
  Combinatorial Pattern Matching (CPM), 2016.

• The link between Orthology Relations and Gene Trees - A Correction perspective
  M. Lafond, R. Dondi and N. El-Mabrouk
  Algorithms for Molecular Biology, Vol. 11, 2016
  Presented at 16th Workshop on Algorithms in Bioinformatics (WABI), 2016

• Reconstructing a SuperGeneTree minimizing reconciliation
  M. Lafond, A. Ouangraoua and N. El-Mabrouk.
  BMC-Genomics, Vel. 16, Suppl. 14, S4, 2015
  Presented at RECOMB-CG , 2015
  

• Orthology Relation and Gene Tree Correction: Complexity Results (preview)
  M. Lafond and N. El-Mabrouk
  WABI 2015, Algorithms in Bioinformatics, Vol. 9289 of LNCS, pp 66-79, 2015.

• Evolution of tRNA Repertoires in Bacillus Inferred with OrthoAlign
  O. Tremblay-Savard, B. Benzaid, B. F. Lang and N. El-Mabrouk.
  Molecular Biology and Evolution, Vol. 32, Num. 6, pp 1643-1656, 2015

• Polytomy refinement for the correction of dubious duplications in gene trees
  Manuel Lafond, Cédric Chauve, Riccardo Dondi and Nadia El-Mabrouk,
  Bioinformatics, Volume 30, Num. 17, pp. i519-i526, 2014
  Presented at ECCB, 2014
  

• Orthology and paralogy constraints: satisfiability and consistency
  (preview) Please take this version. The journal version is full of errors and mathematical style problems.
  Manuel Lafond and Nadia El-Mabrouk,
  BMC-Genomics, 15(Suppl 6):S12, special issue for RECOMB-CG, 2014.

• Gene order alignment on trees with multiOrthoAlign
  (preview) Please take this version. The journal version is full of errors and mathematical style problems.
  Billel Benzaid and Nadia El-Mabrouk,
  BMC-Genomics, 15(Suppl 6):S5, special issue for RECOMB-CG, 2014.

• Gene Tree Correction for Reconciliation and Species Tree Inference: Complexity and Algorithms
  Riccardo Dondi, Nadia El-Mabrouk, and Krister M. Swenson.
  Journal of Discrete Algorithms , Vol. 25, pp. 51 - 65, 2014

• Error detection and correction of gene trees (preview)
  Manuel Lafond, Nadia El-Mabrouk and Krister M. Swenson.
  Models and algorithms for genome evolution, Computational Biology series, Springer , pp. 261-286, 2013.

• Duplication, rearrangement and reconciliation: a follow-up 13 years later (preview)
  Cédric Chauve, Nadia El-Mabrouk, Laurent Gueguen, Magalie Semeria and E. Tannier.
  Models and algorithms for genome evolution, Computational Biology series, Springer , pp. 47-62, 2013.

• Gene tree correction guided by orthology
  Manuel Lafond, Magalie Semeria, Krister M. Swenson, Eric Tannier and Nadia El-Mabrouk
  BMC Bioinformatics, Vol. 14, Suppl 15, S5, 2013.

• Aligning and Labeling Genomes Under the Duplication-Loss Model (preview)
  Riccardo Dondi and Nadia El-Mabrouk
  Computability in Europe (CiE 2013), LNCS 7921, pp.97-107, 2013.

• Duplication-Loss Genome Alignment: Complexity and Algorithm (preview)
  Billel Benzaid, Riccardo Dondi, Nadia El-Mabrouk
  Language and Automata Theory and Applications, (LATA) , LNCS 7810, pp 116-127, 2013.

• Ancestral Genome Organization: an Alignment Approach (preview)
  P. Holloway, K. Swenson, D. Ardell and N. El-Mabrouk
  Journal of Computational Biology, 20(4): 280-295, 2013.

• Gene Tree Correction for Reconciliation and Species Tree Inference
  K. M. Swenson, A. Doroftei and N. El-Mabrouk
  Algorithms for Molecular Biology, 7(1):31. doi: 10.1186/1748-7188-7-31, 2012.

• Gene Trees and Species Trees: Irreconcilable Differences
  K. M. Swenson and N. El-Mabrouk
  BMC Bioinformatics 13 (Suppl 19): S15, 2012.

• A Flexible Ancestral Genome Reconstruction Method based on Gapped Adjacencies
  Y. Gagnon, M. Blanchette and N. El-Mabrouk
  BMC Bioinformatics, 13 (Suppl 19): S4, 2012.

• An Optimal Reconciliation Algorithm for Gene Trees with Polytomies (preview)
  M. Lafond, K.M. Swenson and N. El-Mabrouk
  WABI 2012, Algorithms in Bioinformatics, LNCS/LNBI 7534, pp.106-122, 2012.

• Minimum Leaf Removal for Reconciliation: Complexity and Algorithms (preview)
  Riccardo Dondi and N. El-Mabrouk
  Combinatorial Pattern Matching (CPM), 2012.

• Evolution of Genome Organization by Duplication and Loss: an Alignment Approach (preview)
  P. Holloway, K. Swenson, D. Ardell and N. El-Mabrouk
  RECOMB, LNCS/LNBI 7262, 94-112, 2012.
  RECOMB 2012 Best Paper Award

• Analysis of Gene Order Evolution beyond Single-Copy Genes (preview)
  N. El-Mabrouk and D. Sankoff
  Methods in Molecular Biology, Vol. 855, Evolutionary Genomics: statistical and computational methods, pp. 397 - 429, Springer (Humana), 2012.

• Evolution of orthologous tandemly arrayed gene clusters
  O. Tremblay-Savard, D. Bertrand and N. El-Mabrouk
  BMC Bioinformatics, 12(Suppl 9):S2 doi:10.1186/1471-2105-12-S9-S2, 2011.

• Removing Noise from Gene Trees (preview)
  A. Doroftei and N. El-Mabrouk
  WABI 2011, Algorithms in Bioinformatics, LNCS/LNBI 6833, pp.76-91, 2011.

• Genome Halving and Double Distance with Losses (preview)
  O. Tremblay-Savard, Y. Gagnon, D. Bertrand and N. El-Mabrouk
  Journal of Computational Biology, Vol. 18, Num. 9, pp. 1185-1199, 2011.

• Advances on Genome Duplication Distances (preview)
  Y. Gagnon, O. Tremblay-Savard, D. Bertrand and N. El-Mabrouk
  RECOMB Comparative Genomics (RECOMB-CG) , LNCS/LNBI 6398, pp. 25-38, 2010.

• Reconstruction of Ancestral Genome subject to Whole Genome Duplication, Speciation, Rearrangement and Loss (preview)
  D. Bertrand, Y. Gagnon, M. Blanchette and N. El-Mabrouk
  WABI , LNCS/LNBI 6293, pp. 78- 89, 2010.

• Inferring the Evolutionary History of Gene Clusters from Phylogenetic and Gene Order Data. (journal version ,software)
  M. Lajoie, D. Bertrand and N. El-Mabrouk.
  Molecular Biology and Evolution , Vol.27, No. 4, pp. 761-772, 2010.

• Genetic Map Refinement using a Comparative Genomic Approach. (journal version)
  D. Bertrand, M. Blanchette and N. El-Mabrouk.
  Journal of Computational Biology, Vol. 16, No. 10, 1475-1486, 2009.

• New perspectives on gene family evolution: losses in reconciliation and a link with supertrees. (preview)
  C. Chauve and N. El-Mabrouk.
  RECOMB, LNCS 5541, pp. 46-58, 2009.

• The artiodactyl APOBEC3 innate immune repertoire shows evidence for a multi-functional domain organization that existed in the ancestor of placental mammals.
  R.S. LaRue, S.R. Jonsson, K.A.T. Silverstein, M. Lajoie, D. Bertrand, N. El-Mabrouk, I. Hotzel, V. Andresdottir, T.P.L. Smith and R.S. Harri
  BMC Molecular Biology, Vol.9, No. 104, 20 pages, 2008.

• Inferring Ancestral Gene Orders for a Family of Tandemly Arrayed Genes.
  D. Bertrand, M. Lajoie and N. El-Mabrouk.
  Journal of Computational Biology, Vol. 15, No.8, pp 1063-1077, 2008.

• Gene Family Evolution by Duplication, Speciation and Loss.
  C. Chauve, J.P. Doyon and N. El-Mabrouk.
  Journal of Computational Biology , Vol. 15, No.8, pp 1043-1062, 2008.

• A Phylogenetic Approach to Genetic Map Refinement.
  D. Bertrand, M. Blanchette and N. El-Mabrouk.
  The Sixth RECOMB Comparative Genomics Satellite Workshop, LNCS/LNBI 5267, pp. 198-210, 2008.

• Gene Maps Linearization using Genomic Rearrangement Distances.
  G. Blin, E. Blais, D. Hermelin, P. Guillon, M. Blanchette and N. El-Mabrouk.
  Journal of Computational Biology, Vol. 14, No. 4, pp.394-407, 2007.

• Duplication and Inversion History of a Tandemly Repeated Genes Family.
  M. Lajoie, D. Bertrand, N. El-Mabrouk and O. Gascuel.
  Journal of Computational Biology, Vol. 14, Issue 4, pp. 462-478, 2007.

• Inferring a Duplication, Speciation and Loss History from a Gene Tree .
  C. Chauve, J.P. Doyon and N. El-Mabrouk.
  The Fifth RECOMB Comparative Genomics Satellite Workshop, LNBI4751, pp. 45-55, 2007.

• Evolution of Tandemly Arrayed Genes in Multiple Species .
  M. Lajoie, D. Bertrand and N. El-Mabrouk.
  The Fifth RECOMB Comparative Genomics Satellite Workshop, LNBI4751, pp. 96-109, 2007.

• Seed-based Exclusion Method for Non-coding RNA Gene Search .
  J.E. Duchesne, M. Giraud and N. El-Mabrouk.
  The 13th Annual International Computing and Combinatorics Conference (COCOON 2007), Banff, Canada, 2007.

• Inferring Gene Orders from Gene Maps using the Breakpoint Distance.
  G. Blin, E. Blais, P. Guillon, M. Blanchette and N. El-Mabrouk.
  Fourth RECOMB Comparative Genomics Satellite Workshop. LNCS/LNBI 4205, pp. 99-112, 2006.

• Evolution of Tandemly Repeated Sequences through Duplication and Inversion.
  D. Bertrand, M. Lajoie, N. El-Mabrouk and O. Gascuel.
  Fourth RECOMB Comparative Genomics Satellite Workshop. LNCS/LNBI 4205, pp. 129-140, 2006.

• Genome Rearrangements with Gene Families.
  Mathematics of Evolution and Phylogeny ,
  N. El-Mabrouk.
  Chapter 11, ed. Olivier Gascuel, Oxford University Press, 2005.

• Recovering Haplotype Structure through Recombination and Gene Conversion .
  M. Lajoie and N. El-Mabrouk
  Bioinformatics, 21 (suppl. 2), pp. ii173-ii179, Fourth European Conference on Computational Biology (ECCB), 2005.

• Approximate Matching of Secondary Structures .
  N. El-Mabrouk, M. Raffinot, J.E. Duchesne, M. Lajoie and N. Luc.
  Journal of Bioinformatics and Computational Biology, Vol. 3, No. 2, pp. 317-342, 2005.

• G. Bourque, Y. Yacef and N. El-Mabrouk.
  Maximizing Synteny Blocks to Identify Ancestral Homologs .
  LNCS/LNBI 3678, pp. 21-34, 3rd RECOMB Comparative Genomics Satellite Workshop, Dublin (Ireland), Sept. 2005.

• Deriving Haplotypes through Recombination and Gene Conversion.
  N. El-Mabrouk.
  Journal of Bioinformatics and Computational Biology, Vol. 2, No. 2, pp. 241-256, June 2004.

• Haplotypes Histories as Pathways of Recombinations .
  N. El-Mabrouk and D. Labuda.
  Bioinformatics, Vol. 20, pp. 1836-1841, 2004.

• The Distribution of Inversion Lengths in Bacteria .
  D. Sankoff, J.F. Lefebvre, E. Tillier, A. Maler and N. El-Mabrouk.
  LNCS/LNBI 3388, pp. 97-108, Second RECOMB Comparative Genomics Satellite Workshop, Bertinoro (Italy), 2004.

• Detection and Validation of Single Gene Inversions .
  J.F. Lefebvre and N. El-Mabrouk, E. Tillier and D. Sankoff.
  Bioinformatics, Vol. 19, Suppl. 1, special issue, 11th International Conference on Intelligent Systems for Molecular Biology (ISMB), pp 190-196, 2003.

• The Reconstruction of Doubled Genomes.
  N. El-Mabrouk and D. Sankoff.
  SIAM, Journal on Computing, Vol 32, No 1, pp. 754-792, 2003.

• Reconstructing an ancestral genome using minimum segments duplications and reversals.
  N. El-Mabrouk.
  Journal of Computer and System Sciences, Vol. 65, pp. 442-464, 2002.

• Exploring the set of all minimal sequences of reversals - An application to test the replication-directed reversal hypothesis .
  Y. Ajana, J.F. Lefebvre, E. Tillier and N. El-Mabrouk.
  Second International Workshop, Algorithms in Bioinformatics (WABI'02), LNCS 2452, R. Guigo and D. Gusfield eds., pp. 300-315, September 2002.

• Approximate Matching of Secondary Structures - Extended Abstract.
  N. El-Mabrouk and M. Raffinot.
  Proceedings of the sixth annual international conference on computational molecular biology (RECOMB02), pages 156-164, April 2002.
  The algorithm contains a flaw. For the complete and corrected version, consult our paper in Journal of Bioinformatics and Computational Biology above.

• Computational Methods for Genome Comparison and Applications.
  D. Sankoff, N. El-Mabrouk.
  Current Topics in Computational Biology, Chapter 10, Computational Molecular Biology Series, MIT Press, 2001.

• Sorting Signed Permutations by Reversals and Insertions/Deletions of Contiguous Segments.
  N. El-Mabrouk.
  Journal of Discrete Algorithms. Vol 1, No 1 pp. 105-122, 2001.

• N. El-Mabrouk. Genome rearrangement by reversals and insertions/deletions of contiguous segments. Combinatorial Pattern Matching, 11th annual symposium, Lecture Notes in Computer Science, Vol 1848, pp. 222-234, 2000.

• N. El-Mabrouk. Recovery of ancestral tetraploids. Comparative Genomics: Empirical and Analytical Approaches to Gene Order Dynamics, Map alignment and the Evolution of Gene Families. Computational Biology Series. Kluwer Academic Publishers. Vol 1. pp. 465-477, 2000.

• D. Sankoff and N. El-Mabrouk. Duplication, rearrangement and reconciliation. Comparative Genomics: Empirical and Analytical Approaches to Gene Order Dynamics, Map alignment and the Evolution of Gene Families. Computational Biology Series. Kluwer Academic Publishers. Vol. 1, pp. 537-550, 2000.

• N. El-Mabrouk. Reconstruction d'un génome dupliqué ancestral. Actes de JOBIM, Montpellier, Mai 2000.

• D. Sankoff and N. El-Mabrouk. Reconstitution de l'ordre des gènes dans les génomes ancestraux à partir de données sur les familles multigéniques. Actes de JOBIM, Montpellier, Mai 2000.

• N. El-Mabrouk and D. Sankoff. On the reconstruction of ancient doubled circular genomes using minimum reversal. Genome Informatics, Series No. 10, 83-93, Universal Academy Press, Tokyo, December 1999.

• N. El-Mabrouk and D. Sankoff. Hybridization and Genome Rearrangement. Lecture Notes in Computer Science, CPM, 10th annual symposium. Warwick, UK, July 1999.

• N. El-Mabrouk and D. Bryant and D. Sankoff. Reconstructing the Pre-Doubling Genome. Third annual international conference on computational molecular biology (RECOMB99), to appear in the conference proceedings, ACM press. Lyon, France, April 1999.

• N. El-Mabrouk and J. Nadeau and D. Sankoff. Genome Halving. In M. Farach editor, Lecture Notes in Computer Science, volume 1448 of CPM, 9th annual symposium, pages 235-250. Piscataway, New-Jersey, USA, July 1998.

• N. El-Mabrouk and F. Lisacek. Very fast identification of RNA motifs in genomic DNA. Application to tRNA search in the yeast genome. Journal of Molecular Biology, 264:46-55, November 1996.
  
  

• N. El-Mabrouk and M. Crochemore. Boyer-Moore strategy to efficient approximate string matching. In D. Hirschberg and G. Myers, editors, Lecture Notes in Computer Science, volume 1075 of CPM, 7th annual symposium, pages 24-38. Laguna Beach, California, June 1996.