Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Haris Gavranovic

dblp:24/2259 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2012
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2Applied, interdisciplinary, general and emerging computing · 2 · 1 first-authorSoftware engineering, systems software and programming languages · 1Theory of computation · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 87% Computational science and engineering · 13%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › comparative genomics
ancestral genome reconstruction
0.112011
Mapping ancestral genomes with massive gene loss: A matrix sandwich problem · Bioinform. 2011
Bioinformatics and computational biology
comparative genomics
0.112011
Mapping ancestral genomes with massive gene loss: A matrix sandwich problem · Bioinform. 2011
Computational science and engineering
combinatorial optimization
0.012011
Mapping ancestral genomes with massive gene loss: A matrix sandwich problem · Bioinform. 2011

Methods — techniques the papers use, named apart from their topics

lower bound · 0.1heuristic solver · 0.1combinatorial optimization · 0.1
YearPublicationVenuePosition
2012 Orchestrating CSP and Local Search to Solve a Large Scale Energy Management Problem
Mirsad Buljubasic, Haris Gavranovic
FedCSIS2
2012 An Efficient Method for Solving UNSAT 3-SAT and Similar Instances via Static Decomposition - (Poster Presentation)
Emir Demirovic, Haris Gavranovic
SAT2
2011 Efficient Robust Linear Optimization for Large Repositioning Problems
Haris Gavranovic, Mirsad Buljubasic
INOC1
2011 Mapping ancestral genomes with massive gene loss: A matrix sandwich problem
abstract
MOTIVATION: Ancestral genomes provide a better way to understand the structural evolution of genomes than the simple comparison of extant genomes. Most ancestral genome reconstruction methods rely on universal markers, that is, homologous families of DNA segments present in exactly one exemplar in every considered species. Complex histories of genes or other markers, undergoing duplications and losses, are rarely taken into account. It follows that some ancestors are inaccessible by these methods, such as the proto-monocotyledon whose evolution involved massive gene loss following a whole genome duplication. RESULTS: We propose a mapping approach based on the combinatorial notion of 'sandwich consecutive ones matrix', which explicitly takes gene losses into account. We introduce combinatorial optimization problems related to this concept, and propose a heuristic solver and a lower bound on the optimal solution. We use these results to propose a configuration for the proto-chromosomes of the monocot ancestor, and study the accuracy of this configuration. We also use our method to reconstruct the ancestral boreoeutherian genomes, which illustrates that the framework we propose is not specific to plant paleogenomics but is adapted to reconstruct any ancestral genome from extant genomes with heterogeneous marker content. AVAILABILITY: Upon request to the authors. CONTACT: [email protected]; [email protected].
Haris Gavranovic, Cédric Chauve, Jérôme Salse, Eric Tannier
Bioinform.1