10 papers · ranked by Valyu relevance
Alessio P. Buccino, Arjun Sridhar, David Feng, Karel Svoboda + 1 more
The scale of in vivo electrophysiology has expanded in recent years, with simultaneous recordings across thousands of electrodes now becoming routine. These advances have enabled a wide range of discoveries, but they also impose substantial computational demands. Spike sorting, the procedure that extracts spikes from…
Zeinab Mohammadi, Daniel Denman, Achim Klug, Tim C. Lei
Sorting neural voltages measured from a multichannel neural probe to extract the single unit activities of neuronal firing, especially in real-time, remains a significant technical challenge, largely due to the large amount of acquired data and the technical difficulties involved in processing and classifying these…
Stuart Byma, Akash Dhasade, Adrian Altenhoff, Christophe Dessimoz + 1 more
This paper presents a new, parallel implementation of clustering and demonstrates its utility in greatly speeding up the process of identifying homologous proteins. Clustering is a technique to reduce the number of comparison needed to find similar pairs in a set of n elements such as protein sequences. Precise…
Kecong Tang, Ahsan Sanaullah, Degui Zhi, Shaojie Zhang
Durbin’s positional Burrows-Wheeler transform (PBWT) enables algorithms with the optimal time complexity of O(MN) for reporting all vs all haplotype matches in a population panel with M haplotypes and N variant sites. However, even this efficiency may still be too slow when the number of haplotypes reaches millions. To…
Peiyu Zong, Wenpeng Deng, Jian Liu, Jue Ruan
The rapid advancements in sequencing length necessitate the adoption of increasingly efficient sequence alignment algorithms. The Needleman-Wunsch method introduces the foundational dynamic programming (DP) matrix calculation for global alignment, which evaluates the overall alignment of sequences. However, this method…
Constantin Scholl, Kassian Kobert, Tomáš Flouri, Alexandros Stamatakis
Motivated by load balance issues in parallel calculations of the phylogenetic likelihood function, we recently introduced an approximation algorithm for efficiently distributing partitioned alignment data to a given number of CPUs. The goal is to balance the accumulated number of sites per CPU, and, at the same time…
Babu Bassa
In this communication the author describes a software tool named "ChameleonSort". The software program, developed by the present author is useful in the sorting of biological sequence variants like those accumulating mutations while diverging from the common ancestors. Examples include viral protein variants, protein…
Authors not listed
With the ever-increasing demand for atomistic structures representative of real-life systems as well as the ad-vent of exascale computers, it has now become necessary and possible to use advanced global optimization (GO) techniques to intelligently sample the potential energy surface (PES). Given the previous studies…
Alexander S. Shved, Blake E. Ocampo, Elena S. Burlova, Casey L. Olen + 2 more
The construction, management and analysis of large in silico molecular libraries is critical in many areas of modern chemistry. Herein, we introduce the MOLecular LIibrary toolkit, "molli", which is a Python 3 cheminformatics module that provides a streamlined interface for manipulating large in silico libraries.…
Ido Ben-Shalom, Charles Lin, Brian Radak, Woody Sherman + 1 more
Molecular dynamics (MD) simulations of proteins are commonly used to sample from the Boltzmann distribution of conformational states, with wide-ranging applications spanning chemistry, biophysics, and drug discovery. However, MD can be inefficient at equilibrating water occupancy for buried cavities in proteins that…