18 Publikationen
-
2023 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2983338Efficient gene orthology inference via large-scale rearrangementsPUB | PDF | DOI | WoS | PubMed | Europe PMC
Rubert, Diego, Efficient gene orthology inference via large-scale rearrangements. Algorithms for Molecular Biology 18 (1). , 2023 -
2022 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2968237Gene Orthology Inference via Large-Scale Rearrangements for Partially Assembled GenomesPUB | PDF | DOI | Download (ext.)
Rubert, Diego, Gene Orthology Inference via Large-Scale Rearrangements for Partially Assembled Genomes. 22nd International Workshop on Algorithms in Bioinformatics (WABI 2022) 242 (). Dagstuhl, 2022 -
2022 | Kurzbeitrag Konferenz / Poster | Veröffentlicht | PUB-ID: 2965058Algorithms for a Restricted Genome Median ProblemPUB | PDF | DOI | Download (ext.)
Silva, Helmuth O. M., Algorithms for a Restricted Genome Median Problem. Anais do VII Encontro de Teoria da Computação (ETC 2022) = Proceedings of the 7th Theory of Computation Meeting (). Porto Alegre, RS, 2022 -
2021 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2954832Natural family-free genomic distance.PUB | PDF | DOI | WoS | PubMed | Europe PMC
Rubert, Diego, Natural family-free genomic distance.. Algorithms for molecular biology : AMB 16 (1). , 2021 -
2021 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2959611The potential of family-free rearrangements towards gene orthology inferencePUB | DOI | WoS | PubMed | Europe PMC
Rubert, Diego, The potential of family-free rearrangements towards gene orthology inference. Journal of Bioinformatics and Computational Biology 19 (6). , 2021 -
2021 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2965069Algorithms for Normalized Multiple Sequence AlignmentsPUB | PDF | DOI | Download (ext.)
Araujo, Eloi, Algorithms for Normalized Multiple Sequence Alignments. 32nd International Symposium on Algorithms and Computation (ISAAC 2021) 212 (). Dagstuhl, Germany, 2021 -
2020 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2965062Scalable parallel algorithms for maximum matching and Hamiltonian circuit in convex bipartite graphsPUB | DOI | Download (ext.) | WoS
Stefanes, Marco A., Scalable parallel algorithms for maximum matching and Hamiltonian circuit in convex bipartite graphs. Theoretical Computer Science 804 (). , 2020 -
2020 | Preprint | Veröffentlicht | PUB-ID: 2943670On motifs in colored graphsPUB | Download (ext.) | arXiv
Rubert, Diego, On motifs in colored graphs. arXiv:2005.13634 (). , 2020 -
2020 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2942995Searching and Inferring Colorful Topological Motifs in Vertex-Colored GraphsPUB | DOI | WoS
Rubert, Diego, Searching and Inferring Colorful Topological Motifs in Vertex-Colored Graphs. Journal of Combinatorial Optimization 40 (). , 2020 -
2020 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2965072Natural Family-Free Genomic DistancePUB | PDF | DOI | Download (ext.)
Rubert, Diego, Natural Family-Free Genomic Distance. 20th International Workshop on Algorithms in Bioinformatics (WABI 2020) 172 (). Dagstuhl, Germany, 2020 -
2020 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2965061Distance and Similarity Measures in Comparative GenomicsPUB | PDF | DOI | Download (ext.)
Rubert, Diego, Distance and Similarity Measures in Comparative Genomics. Anais do Concurso de Teses e Dissertações da SBC (CTD-SBC 2020) = Proceedings of the 33rd Thesis and Dissertation Contest (). Porto Alegre, RS, 2020 -
2020 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2937712Analysis of local genome rearrangement improves resolution of ancestral genomic maps in plantsPUB | PDF | DOI | WoS | PubMed | Europe PMC
Rubert, Diego, Analysis of local genome rearrangement improves resolution of ancestral genomic maps in plants. BMC Genomics 21 (Suppl. 2). , 2020 -
2019 | Datenpublikation | PUB-ID: 2936848Supplementary Data for "Analysis of local genome rearrangement improves resolution of ancestral genomic maps in plants"PUB | Dateien verfügbar | DOI
Dörr, Daniel, Supplementary Data for "Analysis of local genome rearrangement improves resolution of ancestral genomic maps in plants". (). , 2019 -
2018 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2919006Computing the family-free DCJ similarityPUB | PDF | DOI | WoS | PubMed | Europe PMC
Rubert, Diego, Computing the family-free DCJ similarity. BMC Bioinformatics 19 (Suppl. 6). , 2018 -
2017 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2913015Algorithms for Computing the Family-Free Genomic Similarity under DCJPUB | DOI
Rubert, Diego, Algorithms for Computing the Family-Free Genomic Similarity under DCJ. Comparative Genomics. RECOMB-CG 2017 10562 (). Cham, 2017 -
2017 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2909057Approximating the DCJ distance of balanced genomes in linear timePUB | PDF | DOI | WoS | PubMed | Europe PMC
Rubert, Diego, Approximating the DCJ distance of balanced genomes in linear time. Algorithms for Molecular Biology 12 (1). , 2017 -
2016 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2903708A Linear Time Approximation Algorithm for the DCJ Distance for Genomes with Bounded Number of DuplicatesPUB | DOI
Rubert, Diego, A Linear Time Approximation Algorithm for the DCJ Distance for Genomes with Bounded Number of Duplicates. Algorithms in Bioinformatics. WABI 2016 9838 (). Cham, 2016 -
2015 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2965063SIMBio: Searching and inferring colorful motifs in biological networksPUB | DOI | Download (ext.)
Rubert, Diego, SIMBio: Searching and inferring colorful motifs in biological networks. 2015 IEEE 15th International Conference on Bioinformatics and Bioengineering (BIBE) (). , 2015