Results 61 to 70 of about 58,659 (213)

Subpath Queries on Compressed Graphs: A Survey

open access: yesAlgorithms, 2021
Text indexing is a classical algorithmic problem that has been studied for over four decades: given a text T, pre-process it off-line so that, later, we can quickly count and locate the occurrences of any string (the query pattern) in T in time ...
Nicola Prezza
doaj   +1 more source

Deterministic sub-linear space LCE data structures with efficient construction [PDF]

open access: yes, 2016
Given a string $S$ of $n$ symbols, a longest common extension query $\mathsf{LCE}(i,j)$ asks for the length of the longest common prefix of the $i$th and $j$th suffixes of $S$. LCE queries have several important applications in string processing, perhaps
Bannai, Hideo   +5 more
core   +2 more sources

A New Strategy to Design Reconfigurable Rivest–Shamir–Adleman (RSA) Accelerators

open access: yesInternational Journal of Circuit Theory and Applications, EarlyView.
A reconfigurable FPGA‐based RSA accelerator is proposed using compression‐based modular multipliers combined with pseudomoduli arithmetic. The approach maps modular exponentiation to low‐cost arithmetic domains and applies a correction stage, achieving significant improvements in delay, operating frequency, and delay–area efficiency compared with ...
Augusto C. B. Vassoler   +4 more
wiley   +1 more source

40 years of suffix trees [PDF]

open access: yesCommunications of the ACM, 2016
Tracing the first four decades in the life of suffix trees, their many incarnations, and their applications.
Apostolico, Alberto   +4 more
openaire   +3 more sources

Machine learning model identifies tibial anatomical variables as potential risk factors for anterior cruciate ligament injury

open access: yesKnee Surgery, Sports Traumatology, Arthroscopy, EarlyView.
Abstract Purpose The tibial slope is a well‐known risk factor for anterior cruciate ligament (ACL) injury. As machine learning continues to progress, it has become an increasingly explored tool for clinical screening and risk factor analysis. This study aims to develop and validate a prognostic machine learning model to predict the outcome of ACL ...
Cheng‐Hao Kao   +3 more
wiley   +1 more source

High‐throughput transcriptome mining and in silico screening reveal saccharide feeding stimulants for Cydia pomonella larvae

open access: yesNew Plant Protection, EarlyView.
We identified and characterized the gustatory and ionotropic receptors of Cydia pomonella using transcriptomics and in silico approaches, linking candidate sugar receptors to larval feeding attraction. Functional assays and behavioral tests highlighted isoquercitrin as a key feeding stimulant, providing a foundation for olfactory‐ and taste‐based pest ...
Chenyun Ding   +6 more
wiley   +1 more source

Robust β‐myrcene block copolymer elastomeric vitrimers

open access: yesPolymer International, EarlyView.
Myrcene‐based vitrimeric elastomers were compared: statistical (poly(styrene‐stat‐myrcene‐stat‐AAEMA)] versus ‘hard–soft’ diblock (poly(styrene)‐block‐poly(myrcene‐co‐AAEMA)). The diblock's ability to anchor the glassy poly(styrene) blocks in a self‐assembled microstructure was effective – leading to four times higher tensile stress and ten times ...
Chong Yang Du   +2 more
wiley   +1 more source

Data structures of genome and protein sequences indexing

open access: yesIranian Journal of Information Processing & Management, 2016
Data structure is a tool for storage and retrieval of information which is named logic and mathematic way of specific data organization. various sequences of genes and proteins in various creatures increases the amount of data in genome databases, and ...
Adeleh asadi
doaj  

Pendekatan MapReduce untuk Implementasi Suffix Tree pada AutoComplete Produk dengan Metodologi Agile

open access: yesJuTISI (Jurnal Teknik Informatika dan Sistem Informasi), 2019
With the development of technology and communication nowadays, it encourages everyone to get everything quickly, easily and precisely, especially in the world of e-commerce which is increasingly widespread and needed by almost everyone.
Yosef Ariyanto Irawan   +5 more
doaj   +1 more source

Dynamic dictionary matching and compressed suffix trees [PDF]

open access: yes, 2005
Recent breakthrough in compressed indexing data structures has reduced the space for indexing a text (or a collection of texts) of length n from O(n log n) bits to O(n) bits, while allowing very efficient pattern matching.
Chan, HL, Hon, WK, Lam, TW, Sadakane, K
core   +1 more source

Home - About - Disclaimer - Privacy