Searching journal content for articles similar to Shivakumar and Langmead.

Displaying results 1-10 of 4986
For checked items
  1. ...improves computational efficiency and stabilizes coexpression estimates, mitigating challenges posed by small sample sizes in KNN regression and the inherent noise and sparsity of scRNA-seq data. Beyond coexpression, NNet supports scalable downstream analyses, including (i) clustering and aggregating cell...
  2. ....To demonstrate the flexible scalability of ScPGE, we performed a series of experiments by modifying the number of epigenomic tracks, the number of cCREs, and the structure of ScPGE: (i) scalability of epigenomic tracks (Fig. 2C)—we find that ScPGE using 13 epigenomic tracks performs better than ScPGE using four...
  3. ...types of clusters. The limitation of k-means clustering is well studied; that is, it can only find clusters of globular shapes because each cluster is represented with an average vector (Aggarwal 2015). Although density-based methods (Ester et al. 1996; Rodriguez and Laio 2014) can detect arbitrary...
  4. ...heritability is then defined as the proportion of genetic variance over total phenotypic variance, .One approach to estimating the variance components is to find the maximum likelihood estimator (MLE) and its variants, such as restricted maximum likelihood (REML) estimators (Yang et al. 2011; Loh et al. 2015b...
  5. ...interpretability. We propose QuadKAST, a scalable algorithm focused on testing pairwise interaction effects (quadratic effects) within small to medium-sized sets of genetic variants (window size ≤100) on a trait and provide quantified interpretation of these effects. Comprehensive simulations show that Quad...
  6. ...that offers accuracy and scalability under these challenging scenarios. TREE-QMC builds upon weighted Quartet Max Cut, which takes weighted quartets as input and then constructs a species tree in a divide-and-conquer fashion, at each step forming a graph and seeking its max cut. The wQMC method has been...
  7. ...(Mirzaei and Wu 2015) have been developed. All of these methods reconstruct a tree–child network with the smallest HN. Some of the methods insert reticulate edges or use other editing operations to search a network in the network space. Others reduce the tree–child network reconstruction problem to finding...
  8. ...-scale spatial omics studies. Analyzing simulation and a variety of spatially resolved transcriptomics data showed that SpaGene is more powerful and scalable than existing methods. Spatial expression patterns identified by SpaGene reconstruct unobserved tissue structures. SpaGene also successfully discovers...
  9. ...: mcfrith@edu.k.u-tokyo.ac.jpAbstractThe main way of analyzing genetic sequences is by finding sequence regions that are related to each other. There are many methods to do that, usually based on this idea: Find an alignment of two sequence regions, which would be unlikely to exist between unrelated...
  10. ...type–specific, -wide DNA functional elements at high resolution. With the growing volume of functional annotation data and sequencing variants, existing variant annotation algorithms lack the efficiency and scalability to process big genomic data, particularly when annotating whole- sequencing variants...
For checked items

Preprint Server