10 papers · ranked by Valyu relevance
Jörg Winkler, Gianvito Urgese, Elisa Ficarra, Knut Reinert
Background The function of non-coding RNA sequences is largely determined by their spatial conformation, namely the secondary structure of the molecule, formed by Watson-Crick interactions between nucleotides. Hence, modern RNA alignment algorithms routinely take structural information into account. In order to…
Jiannan Sun, Zhe Kang, Zhenwei Li, Cunbo Fan + 2 more
'Regina Lee'] Currently, multi-target survey telescope arrays play an important role in the build-up and maintenance of space object catalog databases, collecting massive observational data without attributing information. However, the matching process of massive observational data poses significant challenges to…
Eunjae Kim, Sukwon Choi, Cheong Ghil Kim, Woo-Chan Park + 1 more
We propose a multi-threaded algorithm that can improve the performance of geometric acoustic (GA)-based sound propagation algorithms in mobile devices. In general, sound propagation algorithms require high computational cost because they perform based on ray tracing algorithms. For this reason, it is difficult to…
Zhen Zuo, Mingliang Li, Qi Li, Zhuo Li + 4 more
'You Tang' 'Andrea Tangherloni'] The increasing size of genotype data has led to the loading of VCF files becoming a computational bottleneck in various analyses, including imputation and genome-wide association studies (GWAS). To address this issue, we developed a software library, FM3VCF (fast M3VCF), that utilizes…
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…
Arsham Mikaeili Namini, Ali Saberi, Hamed S Najafabadi, Peter Robinson
Runtime benchmarking demonstrated substantial improvements from both architectural redesign and parallelization ([btag334-F1]). Even without parallelism, GEDI 2.0 ran up to $∼$3 $\times$ faster than the legacy implementation, confirming substantial performance gains from improved algorithms and memory access patterns…
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…
Tong Zhou, Pinglu Zhang, Quan Zou, Wu Han + 1 more
We also compare the performance of HAlign4, HAlign3, MAFFT, MUSCLE, and ClustalΩ on real datasets to evaluate their efficiency and accuracy under practical conditions. The results, summarized in [btae718-T1] and [btae718-T2], highlight significant differences in alignment time, memory usage, and accuracy among the…
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…
Myungsun Kim, Inmo Kim, Jihyeon Yong, Hyuksoo Kim + 2 more
'Yuhang Li'] In detection-free tracking, after users freely designate the location of the object to be tracked in the first frame of the video sequence, the location of the object is continuously found in the following video frame sequence. Recently, technologies using a Siamese network and transformer based on DNN…