Results 41 to 50 of about 40,634 (160)

Alien Trees and Shrubs with the Complements Saksamaa (Germany) and Saksa (German) in Early Written Language and Folklore

open access: yesYearbook of Balkan and Baltic Studies
The 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

open access: yesAlgorithms, 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

Faster Compact On-Line Lempel-Ziv Factorization [PDF]

open access: yes, 2013
We present a new on-line algorithm for computing the Lempel-Ziv factorization of a string that runs in $O(N\log N)$ time and uses only $O(N\log\sigma)$ bits of working space, where $N$ is the length of the string and $\sigma$ is the size of the alphabet.
Bannai, Hideo   +4 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

Lyndon Array Construction during Burrows-Wheeler Inversion [PDF]

open access: yes, 2017
In this paper we present an algorithm to compute the Lyndon array of a string $T$ of length $n$ as a byproduct of the inversion of the Burrows-Wheeler transform of $T$.
Louza, Felipe A.   +3 more
core   +3 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

Efficient computation of absent words in genomic sequences

open access: yesBMC Bioinformatics, 2008
Background Analysis of sequence composition is a routine task in genome research. Organisms are characterized by their base composition, dinucleotide relative abundance, codon usage, and so on.
Herold Julia   +2 more
doaj   +1 more source

Mapping arboretum research: Trends, gaps, and opportunities for biodiversity conservation, society, and climate resilience

open access: yesPLANTS, 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

Jumala jälgi ajamas [PDF]

open access: yesMäetagused, 2014
The paper discusses the origins of the Estonian word jumal (‘God’). First, it summarises the versions proposed by previous treatises, and thereafter the linguistic material of Estonian runo songs is analysed in order to detect variations in its usage ...
Ene Vainik
doaj   +1 more source

Suffix Trees Construction and Their Use in Bioinformatics [PDF]

open access: yes, 2011
Práce se zabývá problematikou implementace sufixových stromů a jejich využití v bioinformatice. Jsou zde uvedeny různé druhy algoritmů pro tvorbu sufixových stromů. Především se zabývá implementací on-line metody pro tvorbu sufixového stromu navrženou E.
Hlaváček, Pavel
core  

Home - About - Disclaimer - Privacy