default search action
Fábio Viduani Martinez
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j11]Eloi Araujo, Fábio Viduani Martinez
, Carlos H. A. Higa, José Soares:
Matrices inducing generalized metric on sequences. Discret. Appl. Math. 332: 135-154 (2023) - [j10]Helmuth O. M. Silva, Diego P. Rubert
Algorithms for the genome median under a restricted measure of rearrangement. RAIRO Oper. Res. 57(3): 1045-1058 (2023) - [c10]Cássia C. S. Rosa
Natural Language Processing Techniques for Hate Speech Evaluation for Brazilian Portuguese. ICCSA (Workshops 4) 2023: 104-117 - [c9]Eloi Araujo
Extended Pairwise Sequence Alignment. ICCSA (1) 2023: 218-230 - [i4]Eloi Araujo, Fábio Viduani Martinez, Carlos H. A. Higa, José Soares:
Matrices inducing generalized metric on sequences. CoRR abs/2303.08725 (2023) - 2021
- [j9]Diego P. Rubert
Natural family-free genomic distance. Algorithms Mol. Biol. 16(1): 4 (2021) - [c8]Eloi Araujo, Luiz C. S. Rozante, Diego P. Rubert
Algorithms for Normalized Multiple Sequence Alignments. ISAAC 2021: 40:1-40:16 - [i3]Eloi Araujo, Luiz C. S. Rozante, Diego P. Rubert, Fábio Viduani Martinez:
Algorithms for normalized multiple sequence alignments. CoRR abs/2107.01607 (2021) - 2020
- [j8]Diego P. Rubert
Searching and inferring colorful topological motifs in vertex-colored graphs. J. Comb. Optim. 40(2): 379-411 (2020) - [c7]Diego P. Rubert
Natural Family-Free Genomic Distance. WABI 2020: 3:1-3:23 - [i2]Diego P. Rubert
On motifs in colored graphs. CoRR abs/2005.13634 (2020) - [i1]Diego P. Rubert, Fábio Viduani Martinez, Marília D. V. Braga:
Natural family-free genomic distance. CoRR abs/2007.03556 (2020)
2010 – 2019
- 2018
- [j7]Diego P. Rubert
Computing the family-free DCJ similarity. BMC Bioinform. 19-S(6): 31-42 (2018) - 2017
- [j6]Diego P. Rubert
Approximating the DCJ distance of balanced genomes in linear time. Algorithms Mol. Biol. 12(1): 3:1-3:13 (2017) - [c6]Diego P. Rubert
Algorithms for Computing the Family-Free Genomic Similarity Under DCJ. RECOMB-CG 2017: 76-100 - 2016
- [c5]Diego P. Rubert
A Linear Time Approximation Algorithm for the DCJ Distance for Genomes with Bounded Number of Duplicates. WABI 2016: 293-306 - 2015
- [j5]Fábio Viduani Martinez
On the family-free DCJ distance and similarity. Algorithms Mol. Biol. 10: 13 (2015) - [j4]Pedro Feijão, Fábio Viduani Martinez
On the distribution of cycles and paths in multichromosomal breakpoint graphs and the expected value of rearrangement distance. BMC Bioinform. 16(S19): S1 (2015) - 2014
- [c4]Fábio Viduani Martinez
On the Family-Free DCJ Distance. WABI 2014: 174-186 - [c3]Pedro Feijão, Fábio Viduani Martinez
On the Multichromosomal Hultman Number. BSB 2014: 9-16 - 2010
- [j3]Said Sadique Adi, Marília D. V. Braga, Cristina G. Fernandes
Repetition-free longest common subsequence. Discret. Appl. Math. 158(12): 1315-1324 (2010)
2000 – 2009
- 2008
- [j2]Said Sadique Adi, Marília D. V. Braga, Cristina G. Fernandes, Carlos Eduardo Ferreira, Fábio Viduani Martinez, Marie-France Sagot, Marco Aurelio Stefanes, Christian Tjandraatmadja, Yoshiko Wakabayashi
Repetition-free longest common subsequence. Electron. Notes Discret. Math. 30: 243-248 (2008) - [c2]Ludovic Cottret, Paulo Vieira Milreu, Vicente Acuña, Alberto Marchetti-Spaccamela
Enumerating Precursor Sets of Target Metabolites in a Metabolic Network. WABI 2008: 233-244 - 2007
- [j1]Fábio Viduani Martinez
Algorithms for terminal Steiner trees. Theor. Comput. Sci. 389(1-2): 133-142 (2007) - 2005
- [c1]Fábio Viduani Martinez, José Coelho de Pina, José Soares:
Algorithms for Terminal Steiner Trees. COCOON 2005: 369-379
Coauthor Index
aka: Marília Dias Vieira Braga
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-23 20:32 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: