Roberto Solis-Oba

Prof. Roberto Solis-Oba

orcid

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
13 October 2015 in Algorithmica
Verified
Journal Article
Closed access
PDF file
RSRoberto Solis-Oba
Roberto Solis-Oba
PBPaul Bonsma
Paul Bonsma
SLStefanie Lowski
Stefanie Lowski

5 March 2013 in Theoretical Computer Science
Verified
Journal Article
Closed access
ZSZhendong Shao
Zhendong Shao
RSRoberto Solis-Oba
Roberto Solis-Oba

15 September 2014 in BMC Bioinformatics
Verified
Journal Article
Open access
PDF file
LILucian Ilie
Lucian Ilie
BHBahlul Haider
Bahlul Haider
MMMichael Molnar
Michael Molnar
RSRoberto Solis-Oba
Roberto Solis-Oba
De novo genome assembly of next-generation sequencing data is one of the most important current problems in bioinformatics, essential in many biological applications. In spite of significant amount of work in this area, better solutions are still very much needed. We present a new program, SAGE, for de novo genome assembly. As opposed to most assemblers, which are de Bruijn graph based, SAGE uses the string-overlap graph. SAGE builds upon great existing work on string-overlap graph and maximum likelihood assembly, bringing an important number of new ideas, such as the efficient computation of the transitive reduction of the string overlap graph, the use of (generalized) edge multiplicity statistics for more accurate estimation of read copy counts, and the improved use of mate pairs and min-cost flow for supporting edge merging. The assemblies produced by SAGE for several short and medium-size genomes compared favourably with those of existing leading assemblers. SAGE benefits from innovations in almost every aspect of the assembly process: error correction of input reads, string-overlap graph construction, read copy counts estimation, overlap graph analysis and reduction, contig extraction, and scaffolding. We hope that these new ideas will help advance the current state-of-the-art in an essential area of research in genomics.

8 June 2016 in Algorithms
Verified
Journal Article
Open access
PDF file
DPDaniel Page
Daniel Page
RSRoberto Solis-Oba
Roberto Solis-Oba
In the pursuit of finding subclasses of the makespan minimization problem on unrelated parallel machines that have approximation algorithms with approximation ratio better than 2, the graph balancing problem has been of current interest. In the graph balancing problem each job can be non-preemptively scheduled on one of at most two machines with the same processing time on either machine. Recently, Ebenlendr, Krčál, and Sgall (Algorithmica 2014, 68, 62–80.) presented a 7 / 4 -approximation algorithm for the graph balancing problem. Let r , s ∈ Z + . In this paper we consider the graph balancing problem with two weights, where a job either takes r time units or s time units. We present a 3 / 2 -approximation algorithm for this problem. This is an improvement over the previously best-known approximation algorithm for the problem with approximation ratio 1.652 and it matches the best known inapproximability bound for it.

19 December 2005 in Theoretical Computer Science
Verified
Journal Article
Closed access
GFGreg N. Frederickson
Greg N. Frederickson
RSRoberto Solis-Oba
Roberto Solis-Oba