João Meidanis

Publication Activity (10 Years)

Years Active: 1995-2024
Publications (10 Years): 9

Top Topics

Portfolio Selection

Average Distance

Distance Measurement

Top Venues

IEEE ACM Trans. Comput. Biol. Bioinform.

Publications

João Paulo Pereira Zanetti, Lucas Peres Oliveira, João Meidanis, Leonid Chindelevitch
Counting Sorting Scenarios and Intermediate Genomes for the Rank Distance. IEEE ACM Trans. Comput. Biol. Bioinform. 21 (3) (2024)
João Paulo Pereira Zanetti, Lucas Peres Oliveira, Leonid Chindelevitch, João Meidanis
Generalizations of the genomic rank distance to indels. Bioinform. 39 (3) (2023)
Priscila Biller, João Paulo Pereira Zanetti, João Meidanis
Center Genome with Respect to the Rank Distance. BSB (2020)
João Paulo Pereira Zanetti, Leonid Chindelevitch, João Meidanis
Counting Sorting Scenarios and Intermediate Genomes for the Rank Distance. AlCoB (2019)
João Paulo Pereira Zanetti, Leonid Chindelevitch, João Meidanis
Generalizations of the Genomic Rank Distance to Indels. AlCoB (2019)
Leonid Chindelevitch, João Paulo Pereira Zanetti, João Meidanis
On the rank-distance median of 3 permutations. BMC Bioinform. (6) (2018)
Leonid Chindelevitch, João Meidanis
On the Rank-Distance Median of 3 Permutations. RECOMB-CG (2017)
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
An improved visualization-based approach for project portfolio selection. Comput. Hum. Behav. 73 (2017)
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
A Visualization-Based Approach for Project Portfolio Selection. WorldCIST (1) (2016)
Celmar Guimarães da Silva, Marivaldo Felipe de Melo, Felipi de Paula e Silva, João Meidanis
PQR sort: using PQR trees for binary matrix reorganization. J. Braz. Comput. Soc. 20 (1) (2014)
Pedro Feijão, João Meidanis
Extending the Algebraic Formalism for Genome Rearrangements to Include Linear Chromosomes. IEEE ACM Trans. Comput. Biol. Bioinform. 10 (4) (2013)
Priscila Biller, Pedro Feijão, João Meidanis
Rearrangement-Based Phylogeny Using the Single-Cut-or-Join Operation. IEEE ACM Trans. Comput. Biol. Bioinform. 10 (1) (2013)
João Paulo Pereira Zanetti, Priscila Biller, João Meidanis
On the Matrix Median Problem. WABI (2013)
Pedro Feijão, João Meidanis
Extending the Algebraic Formalism for Genome Rearrangements to Include Linear Chromosomes. BSB (2012)
Pedro Feijão, João Meidanis
SCJ: A Breakpoint-Like Distance that Simplifies Several Rearrangement Problems. IEEE ACM Trans. Comput. Biol. Bioinform. 8 (5) (2011)
Pedro Feijão, João Meidanis
SCJ: A Variant of Breakpoint Distance for Which Sorting, Genome Median and Genome Halving Problems Are Easy. WABI (2009)
Liliana Alcón, Márcia R. Cerioli, Celina M. H. de Figueiredo, Marisa Gutierrez, João Meidanis
Tree loop graphs. Discret. Appl. Math. 155 (6-7) (2007)
Liliana Alcón, Márcia R. Cerioli, Celina M. H. de Figueiredo, Marisa Gutierrez, João Meidanis
Non loop graphs with induced cycles. Electron. Notes Discret. Math. 19 (2005)
Liliana Alcón, Márcia R. Cerioli, Celina M. H. de Figueiredo, Marisa Gutierrez, João Meidanis
Loop Graphs and Asteroidal Sets. Electron. Notes Discret. Math. 22 (2005)
Guilherme P. Telles, João Meidanis
Building PQR trees in almost-linear time. Electron. Notes Discret. Math. 19 (2005)
Liliana Alcón, Celina M. H. de Figueiredo, Márcia R. Cerioli, Marisa Gutierrez, João Meidanis
Tree Loop Graphs. Electron. Notes Discret. Math. 18 (2004)
Celina M. H. de Figueiredo, João Meidanis, Célia Picinin de Mello, Carmen Ortiz
Decompositions for the edge colouring of reduced indifference graphs. Theor. Comput. Sci. 297 (1-3) (2003)
Zanoni Dias, João Meidanis
The Syntenic Distance Problem Using Only Fusions and Fussions. WOB (2003)
Marisa Gutierrez, João Meidanis
Recognizing clique graphs of directed edge path graphs. Discret. Appl. Math. 126 (2-3) (2003)
João Meidanis
Current Challenges in Bioinformatics. SPIRE (2003)
Zanoni Dias, João Meidanis
Sorting by Prefix Transpositions. SPIRE (2002)
Marisa Gutierrez, João Meidanis
On clique graph recognition. Ars Comb. 63 (2002)
João Meidanis, Maria Emília Telles Walter, Zanoni Dias
A Lower Bound on the Reversal and Transposition Diameter. J. Comput. Biol. 9 (5) (2002)
Marisa Gutierrez, João Meidanis
Algebraic theory for the clique operator. J. Braz. Comput. Soc. 7 (3) (2001)
Zanoni Dias, João Meidanis
Genome Rearrangements Distance by Fusion, Fission, and Transposition is Easy. SPIRE (2001)
Maria Emília Telles Walter, Zanoni Dias, João Meidanis
A New Approach for Approximating the Tranposition Distance. SPIRE (2000)
Celina M. H. de Figueiredo, João Meidanis, Célia Picinin de Mello
Total-Chromatic Number and Chromatic Index of Dually Chordal Graphs. Inf. Process. Lett. 70 (3) (1999)
Marisa Gutierrez, João Meidanis
On the Clique Operator. LATIN (1998)
João Meidanis
A simple toolkit for DNA fragment assembly. Mathematical Support for Molecular Biology (1998)
Maria Emília Telles Walter, Zanoni Dias, João Meidanis
Reversal and Transposition Distance of Linear Chromosomes. SPIRE (1998)
Celina M. H. de Figueiredo, João Meidanis, Célia Picinin de Mello
On Edge-Colouring Indifference Graphs. Theor. Comput. Sci. 181 (1) (1997)
Celina M. H. de Figueiredo, João Meidanis, Célia Picinin de Mello
A Linear-Time Algorithm for Proper Interval Graph Recognition. Inf. Process. Lett. 56 (3) (1995)
Celina M. H. de Figueiredo, João Meidanis, Célia Picinin de Mello
On Edge-Colouring Indifference Graphs. LATIN (1995)