Jaime I. Dávila

Orcid: 0000-0002-8163-6267

Affiliations:
  • University of Washington, Seattle, WA, USA
  • Mayo Clinic, Health Sciences Research, Rochester, MN, USA (former)
  • University of Connecticut, Department of Computer Science and Engineering, CT, USA (former)


According to our database1, Jaime I. Dávila authored at least 17 papers between 2004 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Excerno: Using Mutational Signatures in Sequencing Data to Filter False Variants Caused by Clinical Archival.
J. Comput. Biol., April, 2023

2021
Semi-Supervised Topological Analysis for Elucidating Hidden Structures in High-Dimensional Transcriptome Datasets.
IEEE ACM Trans. Comput. Biol. Bioinform., 2021

Excerno: Filtering Mutations Caused by the Clinical Archival Process in Sequencing Data.
Proceedings of the Computational Advances in Bio and Medical Sciences: 11th International Conference, 2021

2018
Approximation Algorithms for the Primer Selection, PlantedMotif Search, and Related Problems.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2017
Challenges of using RNA-seq in the clinical setting.
Proceedings of the 7th IEEE International Conference on Computational Advances in Bio and Medical Sciences, 2017

2015
Bioinformatics Strategies for Identifying Regions of Epigenetic Deregulation Associated with Aberrant Transcript Splicing and RNA-editing.
Proceedings of the BIOINFORMATICS 2015, 2015

2014
MAP-RSeq: Mayo Analysis Pipeline for RNA sequencing.
BMC Bioinform., 2014

RVboost: RNA-seq variants prioritization using a boosting method.
Bioinform., 2014

2007
Randomized Packet Routing, Selection, and Sorting on the POPS Network.
Proceedings of the Handbook of Parallel Computing - Models, Algorithms and Applications., 2007

Approximation Algorithms for the Primer Selection, Planted Motif Search, and Related Problems.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Fast and Practical Algorithms for Planted (l, d) Motif Search.
IEEE ACM Trans. Comput. Biol. Bioinform., 2007

Fast Algorithms for Selecting Specific siRNA in Complete mRNA Data.
Proceedings of the Algorithms in Bioinformatics, 7th International Workshop, 2007

2006
Space and Time Efficient Algorithms for Planted Motif Search.
Proceedings of the Computational Science, 2006

Extending Pattern Branching to Handle Challenging Instances.
Proceedings of the Sixth IEEE International Symposium on BioInformatics and BioEngineering (BIBE 2006), 2006

2005
Packet routing and selection on the POPS network.
J. Parallel Distributed Comput., 2005

Randomized Sorting On The Pops Network.
Int. J. Found. Comput. Sci., 2005

2004
A Fundamental Problem in Computer and Communication.
Proceedings of the 10th International Conference on Parallel and Distributed Systems, 2004


  Loading...