( en | de | ru )

 

Disambiguation of "Feijão, Pedro"

Author of the publication

copydeleteadd this publication to your clipboard
Rearrangement-Based Phylogeny Using the Single-Cut-or-Join Operation.

, , and . IEEE ACM Trans. Comput. Biol. Bioinform., 10 (1): 122-134 (2013)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Andréia Feijão

Benno Pedrotti

Mario Pedroso

Luicy Pedroza Espinoza

Claudia Pedroni

 

Other publications of authors with the same name

PathOGiST: A Novel Method for Clustering Pathogen Isolates by Combining Multiple Genotyping Signals., , , , , , , , , and 2 other author(s). AlCoB, volume 12099 of Lecture Notes in Computer Science, page 108-124. Springer, (2020)Due to COVID-19 postponed to AlCoB 2021..On the family-free DCJ distance and similarity., , , and . Algorithms Mol. Biol., (2015)Extending the Algebraic Formalism for Genome Rearrangements to Include Linear Chromosomes., and . BSB, volume 7409 of Lecture Notes in Computer Science, page 13-24. Springer, (2012)On the distribution of cycles and paths in multichromosomal breakpoint graphs and the expected value of rearrangement distance., , and . BMC Bioinform., 16 (S19): S1 (December 2015)Approximating the DCJ distance of balanced genomes in linear time., , , , and . Algorithms Mol. Biol., 12 (1): 3:1-3:13 (2017)SCJ: A Variant of Breakpoint Distance for Which Sorting, Genome Median and Genome Halving Problems Are Easy., and . WABI, volume 5724 of Lecture Notes in Computer Science, page 85-96. Springer, (2009)Rearrangement-Based Phylogeny Using the Single-Cut-or-Join Operation., , and . IEEE ACM Trans. Comput. Biol. Bioinform., 10 (1): 122-134 (2013)The SinBiota 2.0 Biodiversity Information System., , , , and . eScience, page 142-149. IEEE Computer Society, (2011)A Linear Time Approximation Algorithm for the DCJ Distance for Genomes with Bounded Number of Duplicates., , , , and . WABI, volume 9838 of Lecture Notes in Computer Science, page 293-306. Springer, (2016)On the computational complexity of closest genome problems., , , , and . Discret. Appl. Math., (2020)