João Meidanis

According to our database1, João Meidanis authored at least 47 papers between 1991 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
Models for Similarity Distributions of Syntenic Homologs and Applications to Phylogenomics.
IEEE/ACM Trans. Comput. Biology Bioinform., 2019

A cubic algorithm for the generalized rank median of three genomes.
Algorithms Mol. Biol., 2019

Generalizations of the Genomic Rank Distance to Indels.
Proceedings of the Algorithms for Computational Biology - 6th International Conference, 2019

Counting Sorting Scenarios and Intermediate Genomes for the Rank Distance.
Proceedings of the Algorithms for Computational Biology - 6th International Conference, 2019

2018
On the rank-distance median of 3 permutations.
BMC Bioinform., 2018

A Cubic Algorithm for the Generalized Rank Median of Three Genomes.
Proceedings of the Comparative Genomics - 16th International Conference, 2018

2017
An improved visualization-based approach for project portfolio selection.
Comput. Hum. Behav., 2017

On the Rank-Distance Median of 3 Permutations.
Proceedings of the Comparative Genomics - 15th International Workshop, 2017

2016
A Visualization-Based Approach for Project Portfolio Selection.
Proceedings of the New Advances in Information Systems and Technologies, 2016

2014
PQR sort: using PQR trees for binary matrix reorganization.
J. Braz. Comput. Soc., 2014

2013
Extending the Algebraic Formalism for Genome Rearrangements to Include Linear Chromosomes.
IEEE/ACM Trans. Comput. Biology Bioinform., 2013

Rearrangement-Based Phylogeny Using the Single-Cut-or-Join Operation.
IEEE/ACM Trans. Comput. Biology Bioinform., 2013

On the Matrix Median Problem.
Proceedings of the Algorithms in Bioinformatics - 13th International Workshop, 2013

The Emperor Has No Caps! A Comparison of DCJ and Algebraic Distances.
Proceedings of the Models and Algorithms for Genome Evolution, 2013

2012
A GRASP-based Heuristic for the Project Portfolio Selection Problem.
Proceedings of the 15th IEEE International Conference on Computational Science and Engineering, 2012

2011
SCJ: A Breakpoint-Like Distance that Simplifies Several Rearrangement Problems.
IEEE/ACM Trans. Comput. Biology Bioinform., 2011

The SinBiota 2.0 Biodiversity Information System.
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.
Proceedings of the Algorithms in Bioinformatics, 9th International Workshop, 2009

2007
Sorting by Block-Interchanges and Signed Reversals.
Proceedings of the Fourth International Conference on Information Technology: New Generations (ITNG 2007), 2007

2005
Building PQR trees in almost-linear time.
Electron. Notes Discret. Math., 2005

Non loop graphs with induced cycles.
Electron. Notes Discret. Math., 2005

Loop Graphs and Asteroidal Sets.
Electron. Notes Discret. Math., 2005

2004
Tree Loop Graphs.
Electron. Notes Discret. Math., 2004

2003
Decompositions for the edge colouring of reduced indifference graphs.
Theor. Comput. Sci., 2003

Recognizing clique graphs of directed edge path graphs.
Discret. Appl. Math., 2003

The Syntenic Distance Problem Using Only Fusions and Fussions.
Proceedings of the II Brazilian Workshop on Bioinformatics, 2003

Current Challenges in Bioinformatics.
Proceedings of the String Processing and Information Retrieval, 2003

2002
A Lower Bound on the Reversal and Transposition Diameter.
J. Comput. Biol., 2002

On clique graph recognition.
Ars Comb., 2002

Sorting by Prefix Transpositions.
Proceedings of the String Processing and Information Retrieval, 2002

An Algorithm That Builds a Set of Strings Given Its Overlap Graph.
Proceedings of the LATIN 2002: Theoretical Informatics, 2002

2001
Algebraic theory for the clique operator.
J. Braz. Comput. Soc., 2001

The Clique Operator, Set Families, and Their Properties.
Electron. Notes Discret. Math., 2001

Genome Rearrangements Distance by Fusion, Fission, and Transposition is Easy.
Proceedings of the Eighth International Symposium on String Processing and Information Retrieval, 2001

2000
A New Approach for Approximating the Tranposition Distance.
Proceedings of the Seventh International Symposium on String Processing and Information Retrieval, 2000

1999
Total-Chromatic Number and Chromatic Index of Dually Chordal Graphs.
Inf. Process. Lett., 1999

1998
On the Consecutive Ones Property.
Discret. Appl. Math., 1998

Reversal and Transposition Distance of Linear Chromosomes.
Proceedings of the String Processing and Information Retrieval: A South American Symposium, 1998

On the Clique Operator.
Proceedings of the LATIN '98: Theoretical Informatics, 1998

A simple toolkit for DNA fragment assembly.
Proceedings of the Mathematical Support for Molecular Biology, 1998

1997
On Edge-Colouring Indifference Graphs.
Theor. Comput. Sci., 1997

Introduction to computational molecular biology.
PWS Publishing Company, ISBN: 978-0-534-95262-4, 1997

1996
Using Workflow Management in DNA Sequencing.
Proceedings of the First IFCIS International Conference on Cooperative Information Systems (CoopIS'96), 1996

1995
A Linear-Time Algorithm for Proper Interval Graph Recognition.
Inf. Process. Lett., 1995

Multiple Alignment of Biological Sequences with Gap Flexibility.
Proceedings of the LATIN '95: Theoretical Informatics, 1995

1992
Determining DNA Sequence Similarity Using Maximum Independent Set Algorithms for Interval Graphs.
Proceedings of the Algorithm Theory, 1992

1991
Lower Bounds for Arithmetic Problems.
Inf. Process. Lett., 1991


  Loading...