17 papers · ranked by Valyu relevance
David R. Penas, Patricia González, Jose A. Egea, Ramón Doallo + 1 more
'Julio R. Banga'] Background The development of large-scale kinetic models is one of the current key issues in computational systems biology and bioinformatics. Here we consider the problem of parameter estimation in nonlinear dynamic models. Global optimization methods can be used to solve this type of problems but…
Serge Stephane AMAN, Behou Gerard N'GUESSAN, Djama Djoman Alfred AGBO, Tiemoman KONE
'Tiemoman KONE'] Background With the rapid advancement of information technology, search engine optimisation (SEO) has become crucial for enhancing the visibility and relevance of online content. In this context, the use of cloud platforms like Microsoft Azure is being explored to bolster SEO capabilities. Methods This…
Zuxi Chen, ShiFan Zhang, XianLi Zeng, Meng Mei + 3 more
'Lixiao Zheng' 'Sedat Akleylek'] This article presents a novel parallel path detection algorithm for identifying suspicious fraudulent accounts in large-scale banking transaction graphs. The proposed algorithm is based on a three-step approach that involves constructing a directed graph, shrinking strongly connected…
Alejandro F Villaverde, Jose A Egea, Julio R Banga
Background Mathematical models play a key role in systems biology: they summarize the currently available knowledge in a way that allows to make experimentally verifiable predictions. Model calibration consists of finding the parameters that give the best fit to a set of experimental data, which entails minimizing a…
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…
Ahmed Shamsul Arefin, Carlos Riveros, Regina Berretta, Pablo Moscato + 1 more
'Alexandre G. de Brevern'] Background The analysis of biological networks has become a major challenge due to the recent development of high-throughput techniques that are rapidly producing very large data sets. The exploding volumes of biological data are craving for extreme computational power and special computing…
Xiandong Meng, Yanqing Ji
This paper focuses on the latest research and critical reviews on modern computing architectures, software and hardware accelerated algorithms for bioinformatics data analysis with an emphasis on one of the most important sequence analysis applications-hidden Markov models (HMM). We show the detailed performance…
Ivan Komarov, Ali Dashti, Roshan M. D'Souza, Moncho Gomez-Gesteira
In this paper, we describe a new brute force algorithm for building the -Nearest Neighbor Graph (k-NNG). The k-NNG algorithm has many applications in areas such as machine learning, bio-informatics, and clustering analysis. While there are very efficient algorithms for data of low dimensions, for high dimensional data…
Ashish Chapagain, Dima Abuoliem, In Ho Cho, Tongbiao Wang
Multifunctional nanosurfaces receive growing attention due to their versatile properties. Capillary force lithography (CFL) has emerged as a simple and economical method for fabricating these surfaces. In recent works, the authors proposed to leverage the evolution strategies (ES) to modify nanosurface characteristics…
Rick Wertenbroek, Ioannis Xenarios, Yann Thoma, Olivier Delaneau + 1 more
We applied the strategy above on two haplotype matching algorithms from and implemented them as the parallel implementation shown in [vbad021-BOX4]: Algorithm 3 which reports all matches between haplotypes above a given length and Algorithm 4 which reports all set-maximal matches between haplotypes. [vbad021-F1] shows…
Johann M Kraus, Hans A Kestler
Background In recent years, the demand for computational power in computational biology has increased due to rapidly growing data sets from microarray and other high-throughput technologies. This demand is likely to increase. Standard algorithms for analyzing data, such as cluster algorithms, need to be parallelized…
Hassan Mushtaq, Sajid Gul Khawaja, Muhammad Usman Akram, Amanullah Yasin + 3 more
Clustering is the most common method for organizing unlabeled data into its natural groups (called clusters), based on similarity (in some sense or another) among data objects. The Partitioning Around Medoids (PAM) algorithm belongs to the partitioning-based methods of clustering widely used for objects categorization…
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…
Soo Hee Han, Joon Heo, Hong Gyoo Sohn, Kiyun Yu
In this study, a parallel processing method using a PC cluster and a virtual grid is proposed for the fast processing of enormous amounts of airborne laser scanning (ALS) data. The method creates a raster digital surface model (DSM) by interpolating point data with inverse distance weighting (IDW), and produces a…
Martin Werner
This paper provides an abstract analysis of parallel processing strategies for spatial and spatio-temporal data. It isolates aspects such as data locality and computational locality as well as redundancy and locally sequential access as central elements of parallel algorithm design for spatial data. Furthermore, the…
Patrizio Dazzi
Embarrassingly parallel problems are characterised by a very small amount of information to be exchanged among the parts they are split in, during their parallel execution. As a consequence they do not require sophisticated, low-latency, high-bandwidth interconnection networks but can be efficiently computed in…
Sirilak Ketchaya, Apisit Rattanatranurak
Quicksort is an important algorithm that uses the divide and conquer concept, and it can be run to solve any problem. The performance of the algorithm can be improved by implementing this algorithm in parallel. In this paper, the parallel sorting algorithm named the Multi-Deque Partition Dual-Deque Merge Sorting…