Results 61 to 70 of about 3,800 (211)
PLANTS, PEOPLE, PLANET, EarlyView.Arboreta bridge people and nature while conserving tree biodiversity, supporting climate resilience, and advancing environmental education. This study maps over a century of available and indexed arboretum research, uncovering trends, knowledge gaps, and opportunities for collaboration.
Catarina Patoilo Teixeira +1 more
wiley +1 more source
RD-GST: online method for constructing distributed generalized suffix trees
Технічна інженеріяGeneralized suffix trees (GST) are fundamental data structures for exact substring search with linear time complexity with respect to query length , regardless of the size of the indexed corpus.
I.S. Sadovyi, V.V. Vorotnikov
doaj +1 more source
Model‐Based Cybersecurity: Automating Common Vulnerabilities Reporting
Systems Engineering, EarlyView.ABSTRACT The Common Vulnerabilities and Exposures (CVE) Program's mission is to identify, define, and catalog publicly disclosed cybersecurity vulnerabilities. A cybersecurity practitioner who suspects a software, hardware, or service vulnerability, can initiate a CVE‐ID Requesting process, as defined by MITRE.
Ahmad Jbara, Dov Dori
wiley +1 more source
Suffix Tree Construction and Storage with Limited Main Memory [PDF]
, 2003 Schürmann K-B, Stoye J. Suffix Tree Construction and Storage with Limited Main Memory. Forschungsberichte. Bielefeld: Technische Fakultät der Universität Bielefeld; 2003.Suffix trees have been established as one of the most versatile index structures for
Schürmann, Klaus-Bernd +1 more
core +1 more source
Fast Fully-Compressed Suffix Trees [PDF]
, 2014 We speed up the fully-compressed suffix tree representation (FCST), which is the only one using asymptotically optimal space. Classical representations of suffix trees are fast, but require too much space (O(n log n) bits for a string of length n over an
Gonzalo Navarro, Luís M. S. Russo
core +1 more source
Yearbook of Balkan and Baltic StudiesThe study of alien species has become more and more relevant today. In particular, the influence of alien species on the local nature is studied, but more and more studies have also begun to appear on how alien species affect the local language and ...
Jüri Viikberg +2 more
doaj +1 more source
Approximate String Matching with Compressed Indexes
Algorithms, 2009 A compressed full-text self-index for a text T is a data structure requiring reduced space and able to search for patterns P in T. It can also reproduce any substring of T, thus actually replacing T. Despite the recent explosion of interest on compressed
Pedro Morales +3 more
doaj +1 more source
Suffix trees and suffix arrays in primary and secondary storage [PDF]
, 2007 In recent years the volume of string data has increased exponentially, and the speed at which these data is being generated has also increased. Some examples of string data includes biological sequences, internet webpages, and digitalized documents, to ...
Ko, Pang
core +2 more sources
Unsupervised Anomaly Detection System for nIDS-s based on payload and Probabilistic Suffix Trees [PDF]
, 2009 Due to the popularity of computer networks, detection of network attacks is a critical aspect of the security of the companies. As a consequence, any complete security package includes a network Intrusion Detection System (nIDS).
Martín Aramburu, José Ignacio +5 more
core +2 more sources
Microbiology and Immunology, EarlyView.ABSTRACT This study aimed to investigate the prevalence and characteristics of mcr‐positive Enterobacteriaceae in retail meat in Thailand following the national ban on prophylactic colistin use in food producing animals. A total of 152 meat samples (103 chicken and 49 pork) were collected from supermarkets and open markets between July and September ...
Ahmed Abououf +7 more
wiley +1 more source