Advanced search
Start date
Betweenand

Zanoni Dias

CV Lattes GoogleMyCitations ORCID


Universidade Estadual de Campinas (UNICAMP). Instituto de Computação (IC)  (Institutional affiliation for the last research proposal)
Birthplace: Brazil

Zanoni Dias in research grants and scholarships supported by FAPESP.

Research grants
Scholarships in Brazil
Scholarships abroad
FAPESP support in numbers * Updated February 15, 2020
Total / Available in English
Most frequent collaborators in research granted by FAPESP
Contact researcher

Use this Research Supported by FAPESP (BV/FAPESP) channel only to send messages referring to FAPESP-funded scientific projects.


 

 

 

 

Keywords used by the researcher
Scientific publications resulting from Research Grants and Scholarships under the grantee's responsibility (15)

(References retrieved automatically from Web of Science and SciELO through information on FAPESP grants and their corresponding numbers as mentioned in the publications by the authors)

Publications15
Citations67
Cit./Article4.5
Data from Web of Science

DIAS, ULISSES; DIAS, ZANONI. HEURISTICS FOR THE TRANSPOSITION DISTANCE PROBLEM. JOURNAL OF BIOINFORMATICS AND COMPUTATIONAL BIOLOGY, v. 11, n. 5, . Web of Science Citations: 4. (12/01584-3)

GALVAO, GUSTAVO RODRIGUES; LEE, ORLANDO; DIAS, ZANONI. Sorting signed permutations by short operations. Algorithms for Molecular Biology, v. 10, . Web of Science Citations: 6. (14/04718-6, 13/08293-7)

DIAS, ZANONI; DIAS, ULISSES; SETUBAL, JOAO C.. SIS: a program to generate draft genome sequence scaffolds for prokaryotes. BMC Bioinformatics, v. 13, . Web of Science Citations: 20.

DIAS, ULISSES; GALVAO, GUSTAVO RODRIGUES; LINTZMAYER, CARLA NEGRI; DIAS, ZANONI. A general heuristic for genome rearrangement problems. JOURNAL OF BIOINFORMATICS AND COMPUTATIONAL BIOLOGY, v. 12, n. 3, . Web of Science Citations: 2. (12/01584-3, 13/01172-0)

GALVAO, GUSTAVO RODRIGUES; BAUDET, CHRISTIAN; DIAS, ZANONI. Sorting Circular Permutations by Super Short Reversals. IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, v. 14, n. 3, p. 620-633, . Web of Science Citations: 2. (14/04718-6, 13/08293-7)

OIKAWA, MARINA A.; DIAS, ZANONI; ROCHA, ANDERSON DE REZENDE; GOLDENSTEIN, SIOME. Manifold Learning and Spectral Clustering for Image Phylogeny Forests. IEEE Transactions on Information Forensics and Security, v. 11, n. 1, p. 5-18, . Web of Science Citations: 16. (14/19401-8, 14/03535-5)

ARRUDA, THIAGO DA SILVA; DIAS, ULISSES; DIAS, ZANONI. A GRASP-Based Heuristic for the Sorting by Length-Weighted Inversions Problem. IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, v. 15, n. 2, p. 352-363, . Web of Science Citations: 0. (14/19401-8, 12/01584-3, 13/08293-7)

BAUDET, CHRISTIAN; DIAS, ULISSES; DIAS, ZANONI. Sorting by weighted inversions considering length and symmetry. BMC Bioinformatics, v. 16, n. 19, . Web of Science Citations: 3. (14/19401-8, 12/01584-3, 13/08293-7)

OIKAWA, MARINA A.; DIAS, ZANONI; ROCHA, ANDERSON; GOLDENSTEIN, SIOME. Distances in multimedia phylogeny. International Transactions in Operational Research, v. 23, n. 5, SI, p. 921-946, . Web of Science Citations: 0. (14/19401-8, 14/03535-5, 13/08293-7)

MARMEROLA, GUILHERME D.; OIKAWA, MARINA A.; DIAS, ZANONI; GOLDENSTEIN, SIOME; ROCHA, ANDERSON. On the Reconstruction of Text Phylogeny Trees: Evaluation and Analysis of Textual Relationships. PLoS One, v. 11, n. 12, . Web of Science Citations: 4. (14/19401-8, 14/13433-5, 14/03535-5, 13/08293-7, 15/19222-9)

DIAS, ULISSES; GALVAO, GUSTAVO RODRIGUES; LINTZMAYER, CARLA NEGRI; DIAS, ZANONI. A general heuristic for genome rearrangement problems. JOURNAL OF BIOINFORMATICS AND COMPUTATIONAL BIOLOGY, v. 12, n. 3, . Web of Science Citations: 2. (12/01584-3, 13/01172-0)

DIAS, ZANONI; DIAS, ULISSES. Sorting by Prefix Reversals and Prefix Transpositions. DISCRETE APPLIED MATHEMATICS, v. 181, p. 78-89, . Web of Science Citations: 4. (12/01584-3)

LINTZMAYER, CARLA NEGRI; FERTIN, GUILLAUME; DIAS, ZANONI. Sorting permutations and binary strings by length-weighted rearrangements. THEORETICAL COMPUTER SCIENCE, v. 715, p. 35-59, . Web of Science Citations: 0. (14/20738-7, 14/19401-8, 13/01172-0, 15/11937-9, 13/08293-7)

OLIVEIRA, ANDRE RODRIGUES; DIAS, ULISSES; DIAS, ZANONI. On the Sorting by Reversals and Transpositions Problem. JOURNAL OF UNIVERSAL COMPUTER SCIENCE, v. 23, n. 9, p. 868-906, . Web of Science Citations: 1. (14/19401-8, 13/08293-7, 15/11937-9)

LINTZMAYER, CARLA NEGRI; FERTIN, GUILLAUME; DIAS, ZANONI. Approximation algorithms for sorting by length-weighted prefix and suffix operations. THEORETICAL COMPUTER SCIENCE, v. 593, p. 26-41, . Web of Science Citations: 2. (14/20738-7, 14/19401-8, 13/01172-0, 13/08293-7)

Academic Publications

(References retrieved automatically from State of São Paulo Research Institutions)

GALVÃO, Gustavo Rodrigues. Algorithms for sorting by reversals or transpositions, with application to genome rearrangement = Algoritmos para problemas de ordenação por reversões ou transposições, com aplicações em rearranjo de genomas. 2015. Tese (Doutorado) – Universidade Estadual de Campinas, Instituto de Computação.

ALEXANDRINO, Alexsandro Oliveira. Problemas de ordenação de permutações por operações ponderadas. 2019. Dissertação (Mestrado) -

LINTZMAYER, Carla Negri. The problem of sorting permutations by prefix and suffix rearrangements = O problema da ordenação de permutações usando rearranjos de prefixos e sufixos. 2016. Tese (Doutorado) – Universidade Estadual de Campinas, Instituto de Computação.

ALMEIDA, André Atanasio Maranhão. Novas abordagens para o problema do alinhamento múltiplo de sequências. 2013. Tese (Doutorado) – Instituto de Computação. Universidade Estadual de Campinas (UNICAMP).

DIAS, Ulisses Martins. Problemas de comparação de genomas. 2012. Tese (Doutorado) – Instituto de Computação. Universidade Estadual de Campinas (UNICAMP).

DIAS, Zanoni. Rearranjo de genomas : uma coletanea de artigos. 2002. Tese (Doutorado) – Instituto de Computação. Universidade Estadual de Campinas (UNICAMP).

Please report errors in researcher information by writing to: cdi@fapesp.br.
X

Report errors in this page


Error details: