João Meidanis

According to our database, João Meidanis authored at least 50 papers between 1991 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

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

2023

Generalizations of the genomic rank distance to indels.

João Paulo Pereira Zanetti, Lucas Peres Oliveira, Leonid Chindelevitch, João Meidanis

Bioinform., March, 2023

2020

Center Genome with Respect to the Rank Distance.

Priscila Biller, João Paulo Pereira Zanetti, João Meidanis

Proceedings of the Advances in Bioinformatics and Computational Biology, 2020

2019

Models for Similarity Distributions of Syntenic Homologs and Applications to Phylogenomics.

David Sankoff, Chunfang Zheng, Yue Zhang, Joao Meidanis, Eric Lyons, Haibao Tang

IEEE ACM Trans. Comput. Biol. Bioinform., 2019

A cubic algorithm for the generalized rank median of three genomes.

Leonid Chindelevitch, Sean La, Joao Meidanis

Algorithms Mol. Biol., 2019

Generalizations of the Genomic Rank Distance to Indels.

João Paulo Pereira Zanetti, Leonid Chindelevitch, João Meidanis

Proceedings of the Algorithms for Computational Biology - 6th International Conference, 2019

Counting Sorting Scenarios and Intermediate Genomes for the Rank Distance.

João Paulo Pereira Zanetti, Leonid Chindelevitch, João Meidanis

Proceedings of the Algorithms for Computational Biology - 6th International Conference, 2019

2018

On the rank-distance median of 3 permutations.

Leonid Chindelevitch, João Paulo Pereira Zanetti, João Meidanis

BMC Bioinform., 2018

A Cubic Algorithm for the Generalized Rank Median of Three Genomes.

Leonid Chindelevitch, Joao Meidanis

Proceedings of the Comparative Genomics - 16th International Conference, 2018

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

On the Rank-Distance Median of 3 Permutations.

Leonid Chindelevitch, João Meidanis

Proceedings of the Comparative Genomics - 15th International Workshop, 2017

2016

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

Proceedings of the New Advances in Information Systems and Technologies, 2016

2014

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

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

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

On the Matrix Median Problem.

João Paulo Pereira Zanetti, Priscila Biller, João Meidanis

Proceedings of the Algorithms in Bioinformatics - 13th International Workshop, 2013

The Emperor Has No Caps! A Comparison of DCJ and Algebraic Distances.

Joao Meidanis, Sophia Yancopoulos

Proceedings of the Models and Algorithms for Genome Evolution, 2013

2012

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

Proceedings of the 15th IEEE International Conference on Computational Science and Engineering, 2012

2011

SCJ: A Breakpoint-Like Distance that Simplifies Several Rearrangement Problems.

Pedro Feijão, João Meidanis

IEEE ACM Trans. Comput. Biol. Bioinform., 2011

The SinBiota 2.0 Biodiversity Information System.

Cleber V. G. Mira, Pedro Feijão, Tiago Duque-Estrada, Joao Meidanis, Carlos A. Joly

Proceedings of the IEEE 7th International Conference on E-Science, 2011

2009

SCJ: A Variant of Breakpoint Distance for Which Sorting, Genome Median and Genome Halving Problems Are Easy.

Pedro Feijão, João Meidanis

Proceedings of the Algorithms in Bioinformatics, 9th International Workshop, 2009

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

Sorting by Block-Interchanges and Signed Reversals.

Cleber V. G. Mira, Joao Meidanis

Proceedings of the Fourth International Conference on Information Technology: New Generations (ITNG 2007), 2007

2005

Building PQR trees in almost-linear time.

Guilherme P. Telles, 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

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

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

Recognizing clique graphs of directed edge path graphs.

Marisa Gutierrez, João Meidanis

Discret. Appl. Math., 2003

The Syntenic Distance Problem Using Only Fusions and Fussions.

Zanoni Dias, João Meidanis

Proceedings of the II Brazilian Workshop on Bioinformatics, 2003

Current Challenges in Bioinformatics.

João Meidanis

Proceedings of the String Processing and Information Retrieval, 2003

2002

A Lower Bound on the Reversal and Transposition Diameter.

João Meidanis, Maria Emília Telles Walter, Zanoni Dias

J. Comput. Biol., 2002

On clique graph recognition.

Marisa Gutierrez, João Meidanis

Ars Comb., 2002

Sorting by Prefix Transpositions.

Zanoni Dias, João Meidanis

Proceedings of the String Processing and Information Retrieval, 2002

An Algorithm That Builds a Set of Strings Given Its Overlap Graph.

Marília D. V. Braga, Joao Meidanis

Proceedings of the LATIN 2002: Theoretical Informatics, 2002

2001

Algebraic theory for the clique operator.

Marisa Gutierrez, João Meidanis

J. Braz. Comput. Soc., 2001

The Clique Operator, Set Families, and Their Properties.

Marisa Gutierrez, Joao Meidanis

Electron. Notes Discret. Math., 2001

Genome Rearrangements Distance by Fusion, Fission, and Transposition is Easy.

Zanoni Dias, João Meidanis

Proceedings of the Eighth International Symposium on String Processing and Information Retrieval, 2001

2000

A New Approach for Approximating the Tranposition Distance.

Maria Emília Telles Walter, Zanoni Dias, João Meidanis

Proceedings of the Seventh International Symposium on String Processing and Information Retrieval, 2000

1999

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

1998

On the Consecutive Ones Property.

Joao Meidanis, Oscar Porto, Guilherme P. Telles

Discret. Appl. Math., 1998

Reversal and Transposition Distance of Linear Chromosomes.

Maria Emília Telles Walter, Zanoni Dias, João Meidanis

Proceedings of the String Processing and Information Retrieval: A South American Symposium, 1998

On the Clique Operator.

Marisa Gutierrez, João Meidanis

Proceedings of the LATIN '98: Theoretical Informatics, 1998

A simple toolkit for DNA fragment assembly.

João Meidanis

Proceedings of the Mathematical Support for Molecular Biology, 1998

1997

On Edge-Colouring Indifference Graphs.

Celina M. H. de Figueiredo, João Meidanis, Célia Picinin de Mello

Theor. Comput. Sci., 1997

Introduction to computational molecular biology.

João Carlos Setubal, João Meidanis

PWS Publishing Company, ISBN: 978-0-534-95262-4, 1997

1996

Using Workflow Management in DNA Sequencing.

Joao Meidanis, Gottfried Vossen, Mathias Weske

Proceedings of the First IFCIS International Conference on Cooperative Information Systems (CoopIS'96), 1996

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

Multiple Alignment of Biological Sequences with Gap Flexibility.

Joao Meidanis, João C. Setubal

Proceedings of the LATIN '95: Theoretical Informatics, 1995

1992

Determining DNA Sequence Similarity Using Maximum Independent Set Algorithms for Interval Graphs.

Deborah Joseph, Joao Meidanis, Prasoon Tiwari

Proceedings of the Algorithm Theory, 1992

1991

Lower Bounds for Arithmetic Problems.

Joao Meidanis

Inf. Process. Lett., 1991