Results 41 to 50 of about 679,088 (213)

Doubts on Irish Iubhar 'Yew Tree' and Eburacum or York [PDF]

open access: yesВопросы ономастики, 2019
York, a cathedral city in the north of England, was the Eburacum or Colonia Eburacensis of Roman Britain. Its name has usually been explained from Irish iubhar ‘yew tree’ (or alternatively from Welsh efwr ‘hogweed’) and so ‘place where yew trees grow ...
Andrew Breeze
doaj   +1 more source

Structure and Sequence Aligned Code Summarization with Prefix and Suffix Balanced Strategy

open access: yesEntropy, 2023
Source code summarization focuses on generating qualified natural language descriptions of a code snippet (e.g., functionality, usage and version). In an actual development environment, descriptions of the code are missing or not consistent with the code
Jianhui Zeng, Zhiheng Qu, Bo Cai
doaj   +1 more source

Linear-Time Text Compression by Longest-First Substitution

open access: yesAlgorithms, 2009
We consider grammar-based text compression with longest first substitution (LFS), where non-overlapping occurrences of a longest repeating factor of the input text are replaced by a new non-terminal symbol.
Ayumi Shinohara   +5 more
doaj   +1 more source

Compressed property suffix trees

open access: yesInformation and Computation, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wing-Kai Hon   +3 more
openaire   +4 more sources

Feature-Based and String-Based Models for Predicting RNA-Protein Interaction

open access: yesMolecules, 2018
In this work, we study two approaches for the problem of RNA-Protein Interaction (RPI). In the first approach, we use a feature-based technique by combining extracted features from both sequences and secondary structures.
Donald Adjeroh   +6 more
doaj   +1 more source

BuST-Bundled Suffix Trees [PDF]

open access: yes, 2006
We introduce a data structure, the Bundled Suffix Tree (BUST), that is a generalization of a Suffix Tree (ST). To build a BuST we use an alphabet Σ together with a non-transitive relation ≈ among its letters. Following the path of a substring β within a BUST, constructed over a text α of length n, not only the positions of the exact occurrences of β in
Luca Bortolussi   +2 more
openaire   +3 more sources

Wavelet Trees Meet Suffix Trees [PDF]

open access: yesProceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014
33 pages, 5 figures; preliminary version published at SODA ...
Babenko, M.   +3 more
openaire   +5 more sources

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

Faster repetition-aware compressed suffix trees based on Block Trees [PDF]

open access: yes, 2022
The suffix tree is a fundamental data structure in stringology, but its space usage, though linear, is an important problem in applications like Bioinformatics.
Caceres Reyes, Manuel Ariel   +1 more
core   +1 more source

Clinical decision support system for early detection of Alzheimer’s disease using an enhanced gradient boosted decision tree classifier

open access: yesHealth Informatics Journal, 2022
Alzheimer’s disease (AD) is one of the most common forms of dementia contributing to more than 70% of the cases. The factors accounting for the cause and progression of neurodegenerative diseases like AD are primarily genetic, in addition to life style ...
Jayashree P   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy