Results 61 to 70 of about 167,829 (332)

Reference‐Guided Chromosome‐by‐Chromosome de novo Assembly at Scale Using Low‐Coverage High‐Fidelity Long‐Reads with HiFiCCL

open access: yesAdvanced Science, EarlyView.
HiFiCCL, as the first assembly framework specifically designed for low‐coverage high‐fidelity reads, improves the assembly quality of existing assemblers and also enhances downstream applications such as large structural variant (SV) detection (>10 000 bp), synteny analysis, pangenome graph construction, and graph‐based individual‐specific germline SVs
Zhongjun Jiang   +9 more
wiley   +1 more source

OpenFlow table lookup scheme integrating multiple-cell Hash table with TCAM

open access: yesTongxin xuebao, 2016
In OpenFlow networks,switches accept flow rules through standardized interfaces,and perform flow-based packet processing.To facilitate the lookup of flow tables,TCAM has been widely used in OpenFlow switches.However,TCAM is expensive and consumes a large
Chun-qiang LI   +2 more
doaj   +2 more sources

Avoiding Rotated Bitboards with Direct Lookup [PDF]

open access: yes, 2007
This paper describes an approach for obtaining direct access to the attacked squares of sliding pieces without resorting to rotated bitboards. The technique involves creating four hash tables using the built in hash arrays from an interpreted, high level
Tannous, Sam
core  

Mechanism‐Driven Screening of Membrane‐Targeting and Pore‐Forming Antimicrobial Peptides

open access: yesAdvanced Science, EarlyView.
To combat antibiotic resistance, this study employs mechanism‐driven screening with machine learning to identify pore‐forming antimicrobial peptides from amphibian and human metaproteomes. Seven peptides are validated, showing minimal toxicity and membrane disruption.
Jiaxuan Li   +9 more
wiley   +1 more source

Fast Exact Search in Hamming Space with Multi-Index Hashing [PDF]

open access: yes, 2014
There is growing interest in representing image data and feature descriptors using compact binary codes for fast near neighbor search. Although binary codes are motivated by their use as direct indices (addresses) into a hash table, codes longer than 32 ...
Fleet, David J.   +2 more
core   +1 more source

Machine Learning for Green Solvents: Assessment, Selection and Substitution

open access: yesAdvanced Science, EarlyView.
Environmental regulations have intensified demand for green solvents, but discovery is limited by Solvent Selection Guides (SSGs) that quantify solvent sustainability. Training a machine learning model on GlaxoSmithKline SSG, a database of sustainability metrics for 10,189 solvents, GreenSolventDB is developed. Integrated with Hansen solubility metrics,
Rohan Datta   +4 more
wiley   +1 more source

Accelerating Primary Screening of USP8 Inhibitors from Drug Repurposing Databases with Tree‐Based Machine Learning

open access: yesAdvanced Intelligent Discovery, EarlyView.
This study introduces a tree‐based machine learning approach to accelerate USP8 inhibitor discovery. The best‐performing model identified 100 high‐confidence repurposable compounds, half already approved or in clinical trials, and uncovered novel scaffolds not previously studied. These findings offer a solid foundation for rapid experimental follow‐up,
Yik Kwong Ng   +4 more
wiley   +1 more source

An Innovative Approach to Achieve Compositionality Efficiently using Multi-Version Object Based Transactional Systems

open access: yes, 2018
In the modern era of multicore processors, utilizing cores is a tedious job. Synchronization and communication among processors involve high cost. Software transaction memory systems (STMs) addresses this issues and provide better concurrency in which ...
CH Papadimitriou   +7 more
core   +1 more source

Securing Generative Artificial Intelligence with Parallel Magnetic Tunnel Junction True Randomness

open access: yesAdvanced Intelligent Systems, EarlyView.
True random numbers can protect generative artificial intelligence (GAI) models from attacks. A highly parallel, spin‐transfer torque magnetic tunnel junction‐based system is demonstrated that generates high‐quality, energy‐efficient random numbers.
Youwei Bao, Shuhan Yang, Hyunsoo Yang
wiley   +1 more source

Parallel FP-Growth Algorithm Based on Load Balance [PDF]

open access: yesJisuanji gongcheng, 2019
Aiming at the problem that the lookup operation of FP-Growth algorithm has a high time complexity,this paper proposes a new algorithm named LBPFP.The algorithm is based on PFP algorithm,which is added a hash table to the head table to achieve fast access
GAO Quan,WAN Xiaodong
doaj   +1 more source

Home - About - Disclaimer - Privacy