default search action
Ulisses Dias
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j30]Andre Rodrigues Oliveira
, Klairton Lima Brito
Rearrangement Distance Problems: An updated survey. ACM Comput. Surv. 56(8): 206:1-206:27 (2024) - [c30]Klairton Lima Brito
Maximum Alternating Balanced Cycle Decomposition and Applications in Sorting by Intergenic Operations Problems. RECOMB-CG 2024: 153-172 - 2023
- [j29]Klairton Lima Brito
Rearrangement distance with reversals, indels, and moves in intergenic regions on signed and unsigned permutations. J. Bioinform. Comput. Biol. 21(2): 2350009:1-2350009:30 (2023) - [j28]Alexsandro Oliveira Alexandrino
Reversal and Transposition Distance on Unbalanced Genomes Using Intergenic Information. J. Comput. Biol. 30(8): 861-876 (2023) - [j27]Andre Rodrigues Oliveira
Approximation algorithms for sorting by k-cuts on signed permutations. J. Comb. Optim. 45(1): 6 (2023) - [j26]Alexsandro Oliveira Alexandrino
Reversal and Indel Distance With Intergenic Region Information. IEEE ACM Trans. Comput. Biol. Bioinform. 20(3): 1628-1640 (2023) - [j25]Klairton Lima Brito
Genome Rearrangement Distance With a Flexible Intergenic Regions Aspect. IEEE ACM Trans. Comput. Biol. Bioinform. 20(3): 1641-1653 (2023) - [c29]Alexsandro Oliveira Alexandrino, Gabriel Siqueira, Klairton Lima Brito, Andre Rodrigues Oliveira, Ulisses Dias, Zanoni Dias:
Block Interchange and Reversal Distance on Unbalanced Genomes. BSB 2023: 1-13 - 2022
- [j24]Alexsandro Oliveira Alexandrino
Labeled Cycle Graph for Transposition and Indel Distance. J. Comput. Biol. 29(3): 243-256 (2022) - [c28]Alexsandro Oliveira Alexandrino
Transposition Distance Considering Intergenic Regions for Unbalanced Genomes. ISBRA 2022: 100-113 - [c27]Andre Rodrigues Oliveira
Sorting by k-Cuts on Signed Permutations. RECOMB-CG 2022: 189-204 - [c26]Klairton Lima Brito
A New Approach for the Reversal Distance with Indels and Moves in Intergenic Regions. RECOMB-CG 2022: 205-220 - [c25]Alexsandro Oliveira Alexandrino
A 1.375-Approximation Algorithm for Sorting by Transpositions with Faster Running Time. BSB 2022: 147-157 - [i1]Alexsandro Oliveira Alexandrino, Andre Rodrigues Oliveira, Ulisses Dias, Zanoni Dias:
On the Complexity of Some Variations of Sorting by Transpositions. CoRR abs/2202.08357 (2022) - 2021
- [j23]Klairton Lima Brito
An improved approximation algorithm for the reversal and transposition distance considering gene order and intergenic sizes. Algorithms Mol. Biol. 16(1): 24 (2021) - [j22]Klairton Lima Brito
Reversals and transpositions distance with proportion restriction. J. Bioinform. Comput. Biol. 19(4): 2150013:1-2150013:27 (2021) - [j21]Alexsandro Oliveira Alexandrino, Andre Rodrigues Oliveira, Ulisses Dias
Incorporating intergenic regions into reversal and transposition distances with indels. J. Bioinform. Comput. Biol. 19(6): 2140011:1-2140011:13 (2021) - [j20]Alexsandro Oliveira Alexandrino, Andre Rodrigues Oliveira, Ulisses Dias
Genome Rearrangement Distance with Reversals, Transpositions, and Indels. J. Comput. Biol. 28(3): 235-247 (2021) - [j19]Andre Rodrigues Oliveira
Sorting Permutations by Intergenic Operations. IEEE ACM Trans. Comput. Biol. Bioinform. 18(6): 2080-2093 (2021) - [j18]Gabriel Siqueira
Heuristics for Genome Rearrangement Distance With Replicated Genes. IEEE ACM Trans. Comput. Biol. Bioinform. 18(6): 2094-2108 (2021) - [j17]Andre Rodrigues Oliveira
Sorting Signed Permutations by Intergenic Reversals. IEEE ACM Trans. Comput. Biol. Bioinform. 18(6): 2870-2876 (2021) - [c24]Alexsandro Oliveira Alexandrino
Reversal Distance on Genomes with Different Gene Content and Intergenic Regions Information. AlCoB 2021: 121-133 - [c23]Klairton Lima Brito
Reversals Distance Considering Flexible Intergenic Regions Sizes. AlCoB 2021: 134-145 - [c22]Klairton Lima Brito
Reversal and Transposition Distance of Genomes Considering Flexible Intergenic Regions. LAGOS 2021: 21-29 - 2020
- [j16]Klairton Lima Brito
Sorting by Genome Rearrangements on Both Gene Order and Intergenic Sizes. J. Comput. Biol. 27(2): 156-174 (2020) - [j15]Alexsandro Oliveira Alexandrino, Andre Rodrigues Oliveira, Ulisses Dias, Zanoni Dias:
On the Complexity of Some Variations of Sorting by Transpositions. J. Univers. Comput. Sci. 26(9): 1076-1094 (2020) - [j14]Danielle Dias
Image-Based Time Series Representations for Pixelwise Eucalyptus Region Classification: A Comparative Study. IEEE Geosci. Remote. Sens. Lett. 17(8): 1450-1454 (2020) - [j13]Danielle Dias
A Multirepresentational Fusion of Time Series for Pixelwise Classification. IEEE J. Sel. Top. Appl. Earth Obs. Remote. Sens. 13: 4399-4409 (2020) - [j12]Klairton Lima Brito
Heuristics for the Reversal and Transposition Distance Problem. IEEE ACM Trans. Comput. Biol. Bioinform. 17(1): 2-13 (2020) - [c21]Andre Rodrigues Oliveira
A 3.5-Approximation Algorithm for Sorting by Intergenic Transpositions. AlCoB 2020: 16-28 - [c20]Gabriel Siqueira
Heuristics for Reversal Distance Between Genomes with Duplicated Genes. AlCoB 2020: 29-40 - [c19]Klairton Lima Brito
Sorting by Reversals and Transpositions with Proportion Restriction. BSB 2020: 117-128
2010 – 2019
- 2019
- [j11]Andre Rodrigues Oliveira
Super short operations on both gene order and intergenic sizes. Algorithms Mol. Biol. 14(1): 21:1-21:17 (2019) - [j10]Andre Rodrigues Oliveira
Sorting by Weighted Reversals and Transpositions. J. Comput. Biol. 26(5): 420-431 (2019) - [j9]Andre Rodrigues Oliveira
On the Complexity of Sorting by Reversals and Transpositions Problems. J. Comput. Biol. 26(11): 1223-1229 (2019) - [c18]Danielle Dias, Ulisses Dias
Pixelwise Remote Sensing Image Classification Based on Recurrence Plot Deep Features. IGARSS 2019: 1310-1313 - [c17]Klairton Lima Brito
Sorting by Reversals, Transpositions, and Indels on Both Gene Order and Intergenic Sizes. ISBRA 2019: 28-39 - [c16]Ulisses Dias
Block-Interchange Distance Considering Intergenic Regions. BSB 2019: 58-69 - 2018
- [j8]Andre Rodrigues Oliveira
Sorting signed circular permutations by super short operations. Algorithms Mol. Biol. 13(1): 13:1-13:16 (2018) - [j7]Thiago da Silva Arruda, Ulisses Dias
A GRASP-Based Heuristic for the Sorting by Length-Weighted Inversions Problem. IEEE ACM Trans. Comput. Biol. Bioinform. 15(2): 352-363 (2018) - [c15]Klairton Lima Brito
Heuristics for the Sorting Signed Permutations by Reversals and Transpositions Problem. AlCoB 2018: 65-75 - [c14]Danielle Dias, Ulisses Dias:
Transfer Learning with CNN Architectures for Classifying Gastrointestinal Diseases and Anatomical Landmarks. MediaEval 2018 - [c13]Danielle Dias, Ulisses Dias:
Flood Detection from Social Multimedia and Satellite Images Using Ensemble and Transfer Learning with CNN Architectures. MediaEval 2018 - [c12]Andre Rodrigues Oliveira
Super Short Reversals on Both Gene Order and Intergenic Sizes. BSB 2018: 14-25 - [c11]Andre Rodrigues Oliveira
Sorting by Weighted Reversals and Transpositions. BSB 2018: 38-49 - 2017
- [j6]Andre Rodrigues Oliveira, Ulisses Dias, Zanoni Dias:
On the Sorting by Reversals and Transpositions Problem. J. Univers. Comput. Sci. 23(9): 868-906 (2017) - 2015
- [j5]Christian Baudet
Sorting by weighted inversions considering length and symmetry. BMC Bioinform. 16(S19): S3 (2015) - [j4]Zanoni Dias, Ulisses Dias
Sorting by Prefix Reversals and Prefix Transpositions. Discret. Appl. Math. 181: 78-89 (2015) - 2014
- [j3]Ulisses Dias
A general heuristic for genome rearrangement problems. J. Bioinform. Comput. Biol. 12(3) (2014) - [c10]Thiago da Silva Arruda, Ulisses Dias
Heuristics for the Sorting by Length-Weighted Inversions Problem on Signed Permutations. AlCoB 2014: 59-70 - [c9]Ulisses Dias
An improved algorithm for the sorting by reversals and transpositions problem. BCB 2014: 400-409 - [c8]Christian Baudet, Ulisses Dias
Length and Symmetry on the Sorting by Weighted Inversions Problem. BSB 2014: 99-106 - 2013
- [j2]Ulisses Dias
Heuristics for the Transposition Distance Problem. J. Bioinform. Comput. Biol. 11(5) (2013) - [c7]Ulisses Dias
Greedy Randomized Search Procedure to Sort Genomes using Symmetric, Almost-Symmetric and Unitary Inversions. BCB 2013: 181 - [c6]Thiago da Silva Arruda, Ulisses Dias
Heuristics for the Sorting by Length-Weighted Inversion Problem. BCB 2013: 498 - 2012
- [b1]Ulisses Dias:
Genoma comparison problems. University of Campinas, Brazil, 2012 - [j1]Zanoni Dias, Ulisses Dias
SIS: a program to generate draft genome sequence scaffolds for prokaryotes. BMC Bioinform. 13: 96 (2012) - [c5]Zanoni Dias, Ulisses Dias
Sorting genomes using almost-symmetric inversions. SAC 2012: 1368-1374 - 2011
- [c4]Zanoni Dias, Ulisses Dias
Using inversion signatures to generate draft genome sequence scaffolds. BCB 2011: 39-48 - 2010
- [c3]Ulisses Dias
An improved 1.375-approximation algorithm for the transposition distance problem. BCB 2010: 334-337 - [c2]Ulisses Dias
A Simulation Tool for the Study of Symmetric Inversions in Bacterial Genomes. RECOMB-CG 2010: 240-251
2000 – 2009
- 2009
- [c1]Ulisses Dias
Constraint Programming Models for Transposition Distance Problem. BSB 2009: 13-23
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-06-19 21:03 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: