13 papers · ranked by Valyu relevance
Unitsa Sangket, Surakameth Mahasirimongkol, Wasun Chantratita, Pichaya Tandayya + 1 more
'Pichaya Tandayya' 'Yurii S Aulchenko'] Background Genome-Wide Association (GWA) analysis is a powerful method for identifying loci associated with complex traits and drug response. Parts of GWA analyses, especially those involving thousands of individuals and consuming hours to months, will benefit from parallel…
Gonzalo Vera, Ritsert C Jansen, Remo L Suppi
Background R is the preferred tool for statistical analysis of many bioinformaticians due in part to the increasing number of freely available analytical methods. Such methods can be quickly reused and adapted to each particular experiment. However, in experiments where large amounts of data are generated, for example…
Francois Besnier, Kevin A. Glover, Maria Anisimova
This software package provides an R-based framework to make use of multi-core computers when running analyses in the population genetics program STRUCTURE. It is especially addressed to those users of STRUCTURE dealing with numerous and repeated data analyses, and who could take advantage of an efficient script to…
Julia L Turner, Scott T Kelley, James S Otto, Faramarz Valafar + 1 more
'Andrew J Bohonak'] Background The Isolation by Distance Web Service (IBDWS) is a user-friendly web interface for analyzing patterns of isolation by distance in population genetic data. IBDWS enables researchers to perform a variety of statistical tests such as Mantel tests and reduced major axis regression (RMA), and…
Lesia Mochurad, Andrii Sydor, Oleh Ratinskiy
Introduction Streaming services are highly popular today. Millions of people watch live streams or videos and listen to music. Methods One of the most popular streaming platforms is Twitch, and data from this type of service can be a good example for applying the parallel DBSCAN algorithm proposed in this paper. Unlike…
Alessandro Petrini, Marco Mesiti, Max Schubach, Marco Frasca + 7 more
The idea on which multi-core parSMURF builds is that all operations performed on the different parts of the partition can be assigned to multiple core/threads and processed in parallel. Namely, given q threads, the data parts N1, …, Nn are equally distributed among threads so that thread i receives a subset (chunk) Ci…
Zeyu Xia, Canqun Yang, Chenchen Peng, Yifei Guo + 3 more
'Tao Tang' 'Yingbo Cui'] Background The advent of Single Molecule Real-Time (SMRT) sequencing has overcome many limitations of second-generation sequencing, such as limited read lengths, PCR amplification biases. However, longer reads increase data volume exponentially and high error rates make many existing alignment…
Cristian Vidal-Silva, Vannessa Duarte, Jesennia Cárdenas-Cobo, Iván Veas
Parallel computing is a current algorithmic approach to looking for efficient solutions; that is, to define a set of processes in charge of performing at the same time the same task. Advances in hardware permit the massification of accessibility to and applications of parallel computing. Nonetheless, some algorithms…
S. Katharina Schmitz, Philipp P. Hasselbach, Boris Ebisch, Anja Klein + 2 more
'Anja Klein' 'Gordon Pipa' 'Ralf A. W. Galuske'] The identification of important features in multi-electrode recordings requires the decomposition of data in order to disclose relevant features and to offer a clear graphical representation. This can be a demanding task. Parallel Factor Analysis (PARAFAC; Hitchcock…
Rasha Omar, Mostafa Abbas, Ahmed El-Mahdy, Erven Rohou + 1 more
'Rafael Sachetto Oliveira'] With the widespread of multicore systems, automatic parallelization becomes more pronounced, particularly for legacy programs, where the source code is not generally available. An essential operation in any parallelization system is detecting data dependence among parallelization candidate…
Kecong Tang, Ahsan Sanaullah, Degui Zhi, Shaojie Zhang
Durbin’s positional Burrows-Wheeler transform (PBWT) enables algorithms with the optimal time complexity of $OMN$ 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…
Jianfang Cao, Hongyan Cui, Hao Shi, Lijuan Jiao + 1 more
A back-propagation (BP) neural network can solve complicated random nonlinear mapping problems; therefore, it can be applied to a wide range of problems. However, as the sample size increases, the time required to train BP neural networks becomes lengthy. Moreover, the classification accuracy decreases as well. To…
Peiyu Zong, Wenpeng Deng, Jian Liu, Jue Ruan
Farrar recommends employing a stripe method to enhance the implementation of in-sequence parallelism, resulting in significant improvements in parallel performance through the utilization of the SIMD instruction set. This method involves reorganizing the originally sequential computation. The length of each stripe…