default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJoão Meidanis
Person information
- affiliation: University of Campinas, Sao Paulo, Brazil
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j26]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): 316-327 (2024)- 2023
- [j25]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) - 2020
- [c25]Priscila Biller, João Paulo Pereira Zanetti, João Meidanis:
Center Genome with Respect to the Rank Distance. BSB 2020: 141-149
2010 – 2019
- 2019
- [j24]Leonid Chindelevitch, Sean La, Joao Meidanis:
A cubic algorithm for the generalized rank median of three genomes. Algorithms Mol. Biol. 14(1): 16:1-16:16 (2019) - [j23]David Sankoff, Chunfang Zheng, Yue Zhang, Joao Meidanis, Eric Lyons, Haibao Tang:
Models for Similarity Distributions of Syntenic Homologs and Applications to Phylogenomics. IEEE ACM Trans. Comput. Biol. Bioinform. 16(3): 727-737 (2019) - [c24]João Paulo Pereira Zanetti, Leonid Chindelevitch, João Meidanis:
Counting Sorting Scenarios and Intermediate Genomes for the Rank Distance. AlCoB 2019: 137-151 - [c23]João Paulo Pereira Zanetti, Leonid Chindelevitch, João Meidanis:
Generalizations of the Genomic Rank Distance to Indels. AlCoB 2019: 152-164 - 2018
- [j22]Leonid Chindelevitch, João Paulo Pereira Zanetti, João Meidanis:
On the rank-distance median of 3 permutations. BMC Bioinform. 19-S(6): 43-62 (2018) - [c22]Leonid Chindelevitch, Joao Meidanis:
A Cubic Algorithm for the Generalized Rank Median of Three Genomes. RECOMB-CG 2018: 3-27 - 2017
- [j21]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: 685-696 (2017) - [c21]Leonid Chindelevitch, João Meidanis:
On the Rank-Distance Median of 3 Permutations. RECOMB-CG 2017: 256-276 - [e1]Joao Meidanis, Luay Nakhleh:
Comparative Genomics - 15th International Workshop, RECOMB CG 2017, Barcelona, Spain, October 4-6, 2017, Proceedings. Lecture Notes in Computer Science 10562, Springer 2017, ISBN 978-3-319-67978-5 [contents] - 2016
- [c20]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: 835-844 - 2014
- [j20]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): 3:1-3:13 (2014) - 2013
- [j19]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): 122-134 (2013) - [j18]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): 819-831 (2013) - [c19]João Paulo Pereira Zanetti, Priscila Biller, João Meidanis:
On the Matrix Median Problem. WABI 2013: 230-243 - [p1]Joao Meidanis, Sophia Yancopoulos:
The Emperor Has No Caps! A Comparison of DCJ and Algebraic Distances. Models and Algorithms for Genome Evolution 2013: 207-243 - 2012
- [c18]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:
A GRASP-based Heuristic for the Project Portfolio Selection Problem. CSE 2012: 36-41 - [c17]Pedro Feijão, João Meidanis:
Extending the Algebraic Formalism for Genome Rearrangements to Include Linear Chromosomes. BSB 2012: 13-24 - 2011
- [j17]Pedro Feijão, João Meidanis:
SCJ: A Breakpoint-Like Distance that Simplifies Several Rearrangement Problems. IEEE ACM Trans. Comput. Biol. Bioinform. 8(5): 1318-1329 (2011) - [c16]Cleber V. G. Mira, Pedro Feijão, Tiago Duque-Estrada, Joao Meidanis, Carlos A. Joly:
The SinBiota 2.0 Biodiversity Information System. eScience 2011: 142-149
2000 – 2009
- 2009
- [c15]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: 85-96 - 2007
- [j16]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): 686-694 (2007) - [c14]Cleber V. G. Mira, Joao Meidanis:
Sorting by Block-Interchanges and Signed Reversals. ITNG 2007: 670-676 - 2005
- [j15]Guilherme P. Telles, João Meidanis:
Building PQR trees in almost-linear time. Electron. Notes Discret. Math. 19: 33-39 (2005) - [j14]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: 289-295 (2005) - [j13]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: 179-183 (2005) - 2004
- [j12]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: 17-23 (2004) - 2003
- [j11]Marisa Gutierrez, João Meidanis:
Recognizing clique graphs of directed edge path graphs. Discret. Appl. Math. 126(2-3): 297-304 (2003) - [j10]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): 145-155 (2003) - [c13]João Meidanis:
Current Challenges in Bioinformatics. SPIRE 2003: 16-27 - [c12]Zanoni Dias, João Meidanis:
The Syntenic Distance Problem Using Only Fusions and Fussions. WOB 2003: 72-79 - 2002
- [j9]Marisa Gutierrez, João Meidanis:
On clique graph recognition. Ars Comb. 63 (2002) - [j8]João Meidanis, Maria Emília Telles Walter, Zanoni Dias:
A Lower Bound on the Reversal and Transposition Diameter. J. Comput. Biol. 9(5): 743-745 (2002) - [c11]Marília D. V. Braga, Joao Meidanis:
An Algorithm That Builds a Set of Strings Given Its Overlap Graph. LATIN 2002: 52-63 - [c10]Zanoni Dias, João Meidanis:
Sorting by Prefix Transpositions. SPIRE 2002: 65-76 - 2001
- [j7]Marisa Gutierrez, Joao Meidanis:
The Clique Operator, Set Families, and Their Properties. Electron. Notes Discret. Math. 7: 94-97 (2001) - [j6]Marisa Gutierrez, João Meidanis:
Algebraic theory for the clique operator. J. Braz. Comput. Soc. 7(3): 53-64 (2001) - [c9]Zanoni Dias, João Meidanis:
Genome Rearrangements Distance by Fusion, Fission, and Transposition is Easy. SPIRE 2001: 250-253 - 2000
- [c8]Maria Emília Telles Walter, Zanoni Dias, João Meidanis:
A New Approach for Approximating the Tranposition Distance. SPIRE 2000: 199-208
1990 – 1999
- 1999
- [j5]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): 147-152 (1999) - 1998
- [j4]Joao Meidanis, Oscar Porto, Guilherme P. Telles:
On the Consecutive Ones Property. Discret. Appl. Math. 88(1-3): 325-354 (1998) - [c7]João Meidanis:
A simple toolkit for DNA fragment assembly. Mathematical Support for Molecular Biology 1998: 271-288 - [c6]Marisa Gutierrez, João Meidanis:
On the Clique Operator. LATIN 1998: 261-272 - [c5]Maria Emília Telles Walter, Zanoni Dias, João Meidanis:
Reversal and Transposition Distance of Linear Chromosomes. SPIRE 1998: 96-102 - 1997
- [b1]João Carlos Setubal, João Meidanis:
Introduction to computational molecular biology. PWS Publishing Company 1997, ISBN 978-0-534-95262-4, pp. I-XIII, 1-296 - [j3]Celina M. H. de Figueiredo, João Meidanis, Célia Picinin de Mello:
On Edge-Colouring Indifference Graphs. Theor. Comput. Sci. 181(1): 91-106 (1997) - 1996
- [c4]Joao Meidanis, Gottfried Vossen, Mathias Weske:
Using Workflow Management in DNA Sequencing. CoopIS 1996: 114-123 - 1995
- [j2]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): 179-184 (1995) - [c3]Celina M. H. de Figueiredo, João Meidanis, Célia Picinin de Mello:
On Edge-Colouring Indifference Graphs. LATIN 1995: 286-299 - [c2]Joao Meidanis, João C. Setubal:
Multiple Alignment of Biological Sequences with Gap Flexibility. LATIN 1995: 411-426 - 1992
- [c1]Deborah Joseph, Joao Meidanis, Prasoon Tiwari:
Determining DNA Sequence Similarity Using Maximum Independent Set Algorithms for Interval Graphs. SWAT 1992: 326-337 - 1991
- [j1]Joao Meidanis:
Lower Bounds for Arithmetic Problems. Inf. Process. Lett. 38(2): 83-87 (1991)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
