Reference-based genome compression using the longest matched substrings with parallelization consideration
Z Lu, L Guo, J Chen, R Wang - BMC bioinformatics, 2023 - Springer
Background A large number of researchers have devoted to accelerating the speed of
genome sequencing and reducing the cost of genome sequencing for decades, and they …
genome sequencing and reducing the cost of genome sequencing for decades, and they …
Parallel and External-Memory Algorithms for Large-Scale Genomic Sequence-Graph and-Index Construction
J Khan - 2024 - search.proquest.com
Rapid developments in the throughput and affordability of modern genome-sequencing
technologies have made the generation of billions of sequencing reads from biological …
technologies have made the generation of billions of sequencing reads from biological …
Fast, parallel, and cache-friendly suffix array construction
Purpose String indexes such as the suffix array (sa) and the closely related longest common
prefix (lcp) array are fundamental objects in bioinformatics and have a wide variety of …
prefix (lcp) array are fundamental objects in bioinformatics and have a wide variety of …
电网调度控制系统公共信息模型文件快速查询方法
**镇义， 孙云枫， **焱， 宋爱波， 周剑… - 电力系统自动化, 2017 - epjournal.csee.org.cn
电网调度控制系统采用描述电网模型的公共信息模型(CIM) 文件进行多级调度系统间的模型
交换. 在电网调度控制系统内部, 开始采用CIM 文件代替传统的关系数据库作为电网模型多版本 …
交换. 在电网调度控制系统内部, 开始采用CIM 文件代替传统的关系数据库作为电网模型多版本 …