DDDan DeBlasio

Dan DeBlasio

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Dan DeBlasio has a total of 142 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Quantifying domain-specific relevance of computational biology Wikipedia articles using TF-IDF and cosine similarity.

    by Arya Pradeep Menon, Trenton Davis, Megha Hegde, Nicolas C Näpflin, Audra Anjum, Sarah Barman, Dan DeBlasio, Pradeep Eranti, Jean-Christophe Nebel, Nelly Sélem-Mojica, et al.

    Wikipedia is one of the world's most visited websites and serves as the principal open educational resource for computational biology. However, identifying which articles are most relevant to distinct sub-disciplines of computational biology remains largely subjective. This study collected short descriptions for 22 Communities of Special Interest (COSI) groups maintained by the International Society for Computational Biology and downloaded 1536 computational biology articles from English Wikipedia. Following standard text preprocessing, COSI descriptions and Wikipedia articles were embedded in a common TF-IDF vector space. Semantic relatedness was quantified using cosine similarity, yielding a real-valued relevance matrix that maps each COSI to the most pertinent computational biology articles. The resulting scores, typically low in absolute value, captured nuanced differences: general-interest pages such as 'Computational biology' and 'Bioinformatics' ranked highest, whereas niche pages showed high relevance only for specific COSIs. Unsupervised analysis using principal component analysis, k-nearest neighbours, and Leiden community detection revealed clusters of articles corresponding to the particular COSIs and highlighted inter-COSI relationships. This automated pipeline reduces bias compared with manual tagging and enables more precise curation of domain-specific educational resources. The relevance matrix developed in this study is available in the Zenodo repository (doi: 10.5281/zenodo.18311878).

  • Open Access

    Ten simple rules for writing a peer review

    by Farzana Rahman, Dan DeBlasio

  • Open Access

    An educator framework for organizing Wikipedia editathons for computational biology

    by Nelly Sélem-Mojica, Tiago Lubiana, Toni Hermoso Pulido, Aarón Gallego-Crespo, Tülay Karakulak, Megha Hegde, Nicolas C Näpflin, Audra Anjum, Pradeep Eranti, Dan DeBlasio, et al.

    Motivation: Wikipedia is a vital open educational resource in computational biology; however, a significant knowledge gap exists between English and non-English Wikipedias. Reducing this knowledge gap via intensive editing events, or “editathons,” would be beneficial in reducing language barriers that disadvantage learners whose native language is not English. Results: We present a framework to guide educators in organizing editathons for learners to improve and create relevant Wikipedia articles. As a case study, we present the results of an editathon held at the 2024 ISCB Latin America conference, in which ten new articles were created for the Spanish-language edition of Wikipedia. We also present a web tool, “compbio-on-wiki,” which identifies relevant English Wikipedia articles missing in other languages. We demonstrate the value of editathons to expand the accessibility and visibility of computational biology content in multiple languages. Availability and implementation: Source code for the compbio-on-wiki Toolforge site is available at: https://github.com/lubianat/compbio-on-wiki


  • Open Access

    How Much Data Is Sufficient to Learn High-Performing Algorithms?

    by Maria-Florina Balcan, Dan Deblasio, Travis Dick, Carl Kingsford, Tuomas Sandholm, Ellen Vitercik

    Algorithms often have tunable parameters that impact performance metrics such as runtime and solution quality. For many algorithms used in practice, no parameter settings admit meaningful worst-case bounds, so the parameters are made available for the user to tune. Alternatively, parameters may be tuned implicitly within the proof of a worst-case approximation ratio or runtime bound. Worst-case instances, however, may be rare or nonexistent in practice. A growing body of research has demonstrated that a data-driven approach to parameter tuning can lead to significant improvements in performance. This approach uses a training set of problem instances sampled from an unknown, application-specific distribution and returns a parameter setting with strong average performance on the training set. We provide techniques for deriving generalization guarantees that bound the difference between the algorithm’s average performance over the training set and its expected performance on the unknown distribution. Our results apply no matter how the parameters are tuned, be it via an automated or manual approach. The challenge is that for many types of algorithms, performance is a volatile function of the parameters: slightly perturbing the parameters can cause a large change in behavior. Prior research [e.g., 12 , 16 , 20 , 62 ] has proved generalization bounds by employing case-by-case analyses of greedy algorithms, clustering algorithms, integer programming algorithms, and selling mechanisms. We streamline these analyses with a general theorem that applies whenever an algorithm’s performance is a piecewise-constant, piecewise-linear, or—more generally— piecewise-structured function of its parameters. Our results, which are tight up to logarithmic factors in the worst case, also imply novel bounds for configuring dynamic programming algorithms from computational biology.


  • Open Access

    Closing the computational biology ‘knowledge gap’: Spanish Wikipedia as a case study

    by Nelly Sélem-Mojica, Tülay Karakulak, Audra Anjum, Antón Pashkov, Rafael Pérez-Estrada, Karina Enriquez-Guillén, Dan DeBlasio, Sofia Ferreira-Gonzalez, Alejandra Medina-Rivera, Daniel Rodrigo-Torres, et al.

    Motivation: Wikipedia is a vital open educational resource in computational biology. The quality of computational biology coverage in English-language Wikipedia has improved steadily in recent years. However, there is an increasingly large ‘knowledge gap’ between computational biology resources in English-language Wikipedia, and Wikipedias in non-English languages. Reducing this knowledge gap by providing educational resources in non-English languages would reduce language barriers which disadvantage non-native English speaking learners across multiple dimensions in computational biology. Results: Here, we provide a comprehensive assessment of computational biology coverage in Spanish-language Wikipedia, the second most accessed Wikipedia worldwide. Using Spanish-language Wikipedia as a case study, we generate quantitative and qualitative data before and after a targeted educational event, specifically, a Spanish-focused student editing competition. Our data demonstrates how such events and activities can narrow the knowledge gap between English and non-English educational resources, by improving existing articles and creating new articles. Finally, based on our analysis, we suggest ways to prioritize future initiatives to improve open educational resources in other languages. Availability and Implementation: Scripts for data analysis are available at: https://github.com/ISCBWikiTeam/spanish.


  • Open Access

    Sketching methods with small window guarantee using minimum decycling sets

    by Guillaume Marçais, Dan DeBlasio, Carl Kingsford

    Most sequence sketching methods work by selecting specific $k$-mers from sequences so that the similarity between two sequences can be estimated using only the sketches. Estimating sequence similarity is much faster using sketches than using sequence alignment, hence sketching methods are used to reduce the computational requirements of computational biology software packages. Applications using sketches often rely on properties of the $k$-mer selection procedure to ensure that using a sketch does not degrade the quality of the results compared with using sequence alignment. In particular the window guarantee ensures that no long region of the sequence goes unrepresented in the sketch. A sketching method with a window guarantee corresponds to a Decycling Set, aka an unavoidable sets of $k$-mers. Any long enough sequence must contain a $k$-mer from any decycling set (hence, it is unavoidable). Conversely, a decycling set defines a sketching method by selecting the $k$-mers from the set. Although current methods use one of a small number of sketching method families, the space of decycling sets is much larger, and largely unexplored. Finding decycling sets with desirable characteristics is a promising approach to discovering new sketching methods with improved performance (e.g., with small window guarantee). The Minimum Decycling Sets (MDSs) are of particular interest because of their small size. Only two algorithms, by Mykkeltveit and Champarnaud, are known to generate two particular MDSs, although there is a vast number of alternative MDSs. We provide a simple method that allows one to explore the space of MDSs and to find sets optimized for desirable properties. We give evidence that the Mykkeltveit sets are close to optimal regarding one particular property, the remaining path length.

  • Open Access

    Regression Based Accuracy Estimation for Multiple Sequence Alignment

    by Luis Cedillo, Hector Richart Ruiz, Dan DeBlasio

    Multiple sequence alignment plays an important role in many important analyses. However, aligning multiple biological sequences is a complex task, thus many tools have been developed to align sequences under a biologically-inspired objective function. But these tools require a user-defined parameter vector, which if chosen incorrectly, can greatly impact down-stream analysis. Parameter Advising addresses this challenge of selecting input-specific parameter vectors by comparing alignments produced by a carefully constructed set of parameter configurations. In an ideal scenario, we would rank alignments based on their accuracy. However, in practice, we do not have a reference from which to calculate accuracy. Therefore, it becomes necessary to estimate the accuracy to rank the alignments. One solution involves the use of estimators such as Facet . The accuracy estimator Facet computes an estimate of accuracy as a linear combination of efficiently-computable feature functions. In this work we introduce two new estimators called Lead (short for L earned a ccuracy e stimator from large d atasets) which use the same underlying feature functions as Facet but are built on top of highly efficient machine learning protocols, allowing us to take advantage of a larger training corpus. Note about previous versions: A previous version of this paper was released on bioRxiv and presented the results of our previous study ( Facet ) with an error. This error has been corrected, and the conclusions made have been updated based on this new data. This corrected version stands as reference for anyone who may have encountered the versions with inaccuracies.


  • Open Access

    How much data is sufficient to learn high-performing algorithms? generalization guarantees for data-driven algorithm design

    by Maria-Florina Balcan, Dan DeBlasio, Travis Dick, Carl Kingsford, Tuomas Sandholm, Ellen Vitercik

    Algorithms often have tunable parameters that impact performance metrics such as runtime and solution quality. For many algorithms used in practice, no parameter settings admit meaningful worst-case bounds, so the parameters are made available for the user to tune. Alternatively, parameters may be tuned implicitly within the proof of a worst-case guarantee. Worst-case instances, however, may be rare or nonexistent in practice. A growing body of research has demonstrated that data-driven algorithm design can lead to significant improvements in performance. This approach uses a training set of problem instances sampled from an unknown, application-specific distribution and returns a parameter setting with strong average performance on the training set. We provide a broadly applicable theory for deriving generalization guarantees that bound the difference between the algorithm’s average performance over the training set and its expected performance on the unknown distribution. Our results apply no matter how the parameters are tuned, be it via an automated or manual approach. The challenge is that for many types of algorithms, performance is a volatile function of the parameters: slightly perturbing the parameters can cause a large change in behavior. Prior research (e.g., Gupta and Roughgarden, SICOMP’17; Balcan et al., COLT’17, ICML’18, EC’18) has proved generalization bounds by employing case-by-case analyses of greedy algorithms, clustering algorithms, integer programming algorithms, and selling mechanisms. We uncover a unifying structure which we use to prove extremely general guarantees, yet we recover the bounds from prior research. Our guarantees, which are tight up to logarithmic factors in the worst case, apply whenever an algorithm’s performance is a piecewise-constant, -linear, or—more generally—piecewise-structured function of its parameters. Our theory also implies novel bounds for voting mechanisms and dynamic programming algorithms from computational biology.


  • Open Access

    How much data is sufficient to learn high-performing algorithms? Generalization guarantees for data-driven algorithm design

    by Maria-Florina Balcan, Dan DeBlasio, Travis Dick, Carl Kingsford, Tuomas Sandholm, Ellen Vitercik

    Algorithms often have tunable parameters that impact performance metrics such as runtime and solution quality. For many algorithms used in practice, no parameter settings admit meaningful worst-case bounds, so the parameters are made available for the user to tune. Alternatively, parameters may be tuned implicitly within the proof of a worst-case approximation ratio or runtime bound. Worst-case instances, however, may be rare or nonexistent in practice. A growing body of research has demonstrated that data-driven algorithm design can lead to significant improvements in performance. This approach uses a training set of problem instances sampled from an unknown, application-specific distribution and returns a parameter setting with strong average performance on the training set. We provide a broadly applicable theory for deriving generalization guarantees that bound the difference between the algorithm's average performance over the training set and its expected performance. Our results apply no matter how the parameters are tuned, be it via an automated or manual approach. The challenge is that for many types of algorithms, performance is a volatile function of the parameters: slightly perturbing the parameters can cause large changes in behavior. Prior research has proved generalization bounds by employing case-by-case analyses of greedy algorithms, clustering algorithms, integer programming algorithms, and selling mechanisms. We uncover a unifying structure which we use to prove extremely general guarantees, yet we recover the bounds from prior research. Our guarantees apply whenever an algorithm's performance is a piecewise-constant, -linear, or -- more generally -- piecewise-structured function of its parameters. Our theory also implies novel bounds for voting mechanisms and dynamic programming algorithms from computational biology.

  • Open Access

    More Accurate Transcript Assembly via Parameter Advising

    by Dan Deblasio, Kwanho Kim, Carl Kingsford

    Computational tools used for genomic analyses are becoming more accurate but also increasingly sophisticated and complex. This introduces a new problem in that these pieces of software have a large number of tunable parameters that often have a large influence on the results that are reported. We quantify the impact of parameter choice on transcript assembly and take some first steps toward generating a truly automated genomic analysis pipeline by developing a method for automatically choosing input-specific parameter values for reference-based transcript assembly using the Scallop tool. By choosing parameter values for each input, the area under the receiver operator characteristic curve (AUC) when comparing assembled transcripts to a reference transcriptome is increased by an average of 28.9% over using only the default parameter choices on 1595 RNA-Seq samples in the Sequence Read Archive. This approach is general, and when applied to StringTie, it increases the AUC by an average of 13.1% on a set of 65 RNA-Seq experiments from ENCODE. Parameter advisors for both Scallop and StringTie are available on Github .