Lower Bounds for Arithmetic Problems. - Joao Meidanis (Inf. Process. Lett., 1991)

Determining DNA Sequence Similarity Using Maximum Independent Set Algorithms for Interval Graphs. - Deborah Joseph; Joao Meidanis; Prasoon Tiwari (SWAT, 1992)

Multiple Alignment of Biological Sequences with Gap Flexibility. - Joao Meidanis; João C. Setubal (LATIN, 1995)

A Linear-Time Algorithm for Proper Interval Graph Recognition. - Celina M. H. de Figueiredo; João Meidanis; Célia Picinin de Mello (Inf. Process. Lett., 1995)

Using Workflow Management in DNA Sequencing. - Joao Meidanis; Gottfried Vossen; Mathias Weske (CoopIS, 1996)

Introduction to computational molecular biology. - João Carlos Setubal; João Meidanis (PWS Publishing Company, 1997)

On Edge-Colouring Indifference Graphs. - Celina M. H. de Figueiredo; João Meidanis; Célia Picinin de Mello (Theor. Comput. Sci., 1997)

A simple toolkit for DNA fragment assembly. - João Meidanis (Mathematical Support for Molecular Biology, 1998)

On the Clique Operator. - Marisa Gutierrez; João Meidanis (LATIN, 1998)

Reversal and Transposition Distance of Linear Chromosomes. - Maria Emília Telles Walter; Zanoni Dias; João Meidanis (SPIRE, 1998)

On the Consecutive Ones Property. - Joao Meidanis; Oscar Porto; Guilherme P. Telles (Discret. Appl. Math., 1998)

Total-Chromatic Number and Chromatic Index of Dually Chordal Graphs. - Celina M. H. de Figueiredo; João Meidanis; Célia Picinin de Mello (Inf. Process. Lett., 1999)

A New Approach for Approximating the Tranposition Distance. - Maria Emília Telles Walter; Zanoni Dias; João Meidanis (SPIRE, 2000)

Genome Rearrangements Distance by Fusion, Fission, and Transposition is Easy. - Zanoni Dias; João Meidanis (SPIRE, 2001)

The Clique Operator, Set Families, and Their Properties. - Marisa Gutierrez; Joao Meidanis (Electron. Notes Discret. Math., 2001)

Algebraic theory for the clique operator. - Marisa Gutierrez; João Meidanis (J. Braz. Comput. Soc., 2001)

An Algorithm That Builds a Set of Strings Given Its Overlap Graph. - Marília D. V. Braga; Joao Meidanis (LATIN, 2002)

Sorting by Prefix Transpositions. - Zanoni Dias; João Meidanis (SPIRE, 2002)

On clique graph recognition. - Marisa Gutierrez; João Meidanis (Ars Comb., 2002)

A Lower Bound on the Reversal and Transposition Diameter. - João Meidanis; Maria Emília Telles Walter; Zanoni Dias (J. Comput. Biol., 2002)

Current Challenges in Bioinformatics. - João Meidanis (SPIRE, 2003)

The Syntenic Distance Problem Using Only Fusions and Fussions. - Zanoni Dias; João Meidanis (WOB, 2003)

Recognizing clique graphs of directed edge path graphs. - Marisa Gutierrez; João Meidanis (Discret. Appl. Math., 2003)

Decompositions for the edge colouring of reduced indifference graphs. - Celina M. H. de Figueiredo; João Meidanis; Célia Picinin de Mello; Carmen Ortiz (Theor. Comput. Sci., 2003)

Loop Graphs and Asteroidal Sets. - Liliana Alcón; Márcia R. Cerioli; Celina M. H. de Figueiredo; Marisa Gutierrez; João Meidanis (Electron. Notes Discret. Math., 2005)

Non loop graphs with induced cycles. - Liliana Alcón; Márcia R. Cerioli; Celina M. H. de Figueiredo; Marisa Gutierrez; João Meidanis (Electron. Notes Discret. Math., 2005)

Building PQR trees in almost-linear time. - Guilherme P. Telles; João Meidanis (Electron. Notes Discret. Math., 2005)

Sorting by Block-Interchanges and Signed Reversals. - Cleber V. G. Mira; Joao Meidanis (ITNG, 2007)

Tree loop graphs. - Liliana Alcón; Márcia R. Cerioli; Celina M. H. de Figueiredo; Marisa Gutierrez; João Meidanis (Discret. Appl. Math., 2007)

SCJ: A Variant of Breakpoint Distance for Which Sorting, Genome Median and Genome Halving Problems Are Easy. - Pedro Feijão; João Meidanis (WABI, 2009)

The SinBiota 2.0 Biodiversity Information System. - Cleber V. G. Mira; Pedro Feijão; Tiago Duque-Estrada; Joao Meidanis; Carlos A. Joly (eScience, 2011)

SCJ: A Breakpoint-Like Distance that Simplifies Several Rearrangement Problems. - Pedro Feijão; João Meidanis (IEEE ACM Trans. Comput. Biol. Bioinform., 2011)

A GRASP-based Heuristic for the Project Portfolio Selection Problem. - Cleber V. G. Mira; Pedro Feijão; Maria Angélica Souza; Arnaldo Vieira Moura; Joao Meidanis; Gabriel A. Costa Lima; Rafael Schmitz; Renato P. Bossolan; Italo T. Freitas (CSE, 2012)

The Emperor Has No Caps! A Comparison of DCJ and Algebraic Distances. - Joao Meidanis; Sophia Yancopoulos (Models and Algorithms for Genome Evolution, 2013)

On the Matrix Median Problem. - João Paulo Pereira Zanetti; Priscila Biller; João Meidanis (WABI, 2013)

Rearrangement-Based Phylogeny Using the Single-Cut-or-Join Operation. - Priscila Biller; Pedro Feijão; João Meidanis (IEEE ACM Trans. Comput. Biol. Bioinform., 2013)

Extending the Algebraic Formalism for Genome Rearrangements to Include Linear Chromosomes. - Pedro Feijão; João Meidanis (IEEE ACM Trans. Comput. Biol. Bioinform., 2013)

PQR sort: using PQR trees for binary matrix reorganization. - Celmar Guimarães da Silva; Marivaldo Felipe de Melo; Felipi de Paula e Silva; João Meidanis (J. Braz. Comput. Soc., 2014)

A Visualization-Based Approach for Project Portfolio Selection. - Celmar Guimarães da Silva; João Meidanis; Arnaldo Vieira Moura; Maria Angélica Souza; Paulo Viadanna Jr.; Gabriel A. Costa Lima; Rafael S. V. de Barros (WorldCIST (1), 2016)

On the Rank-Distance Median of 3 Permutations. - Leonid Chindelevitch; João Meidanis (RECOMB-CG, 2017)

An improved visualization-based approach for project portfolio selection. - Celmar Guimarães da Silva; João Meidanis; Arnaldo Vieira Moura; Maria Angélica Souza; Paulo Viadanna Jr.; Marcello R. de Oliveira; Maurício Rossi de Oliveira; Lidianne H. Jardim; Gabriel A. Costa Lima; Rafael S. V. de Barros (Comput. Hum. Behav., 2017)

A Cubic Algorithm for the Generalized Rank Median of Three Genomes. - Leonid Chindelevitch; Joao Meidanis (RECOMB-CG, 2018)

On the rank-distance median of 3 permutations. - Leonid Chindelevitch; João Paulo Pereira Zanetti; João Meidanis (BMC Bioinform., 2018)

Counting Sorting Scenarios and Intermediate Genomes for the Rank Distance. - João Paulo Pereira Zanetti; Leonid Chindelevitch; João Meidanis (AlCoB, 2019)

Generalizations of the Genomic Rank Distance to Indels. - João Paulo Pereira Zanetti; Leonid Chindelevitch; João Meidanis (AlCoB, 2019)

A cubic algorithm for the generalized rank median of three genomes. - Leonid Chindelevitch; Sean La; Joao Meidanis (Algorithms Mol. Biol., 2019)

Models for Similarity Distributions of Syntenic Homologs and Applications to Phylogenomics. - David Sankoff; Chunfang Zheng; Yue Zhang; Joao Meidanis; Eric Lyons 002; Haibao Tang (IEEE ACM Trans. Comput. Biol. Bioinform., 2019)

Center Genome with Respect to the Rank Distance. - Priscila Biller; João Paulo Pereira Zanetti; João Meidanis (BSB, 2020)

Generalizations of the genomic rank distance to indels. - João Paulo Pereira Zanetti; Lucas Peres Oliveira; Leonid Chindelevitch; João Meidanis (Bioinform., 2023)

Comparison of computational fusion detection methods for short-read RNA-seq data. - Lucas Peres Oliveira; Victor Rigatto; Natacha A. Migita; José A. Yunes; João Meidanis (BSB, 2024)

Counting Sorting Scenarios and Intermediate Genomes for the Rank Distance. - João Paulo Pereira Zanetti; Lucas Peres Oliveira; João Meidanis; Leonid Chindelevitch (IEEE ACM Trans. Comput. Biol. Bioinform., 2024)