common prefix
Recently Published Documents


TOTAL DOCUMENTS

38
(FIVE YEARS 13)

H-INDEX

9
(FIVE YEARS 1)

Algorithms ◽  
2021 ◽  
Vol 14 (4) ◽  
pp. 116
Author(s):  
Shiori Mitsuya ◽  
Yuto Nakashima ◽  
Shunsuke Inenaga ◽  
Hideo Bannai ◽  
Masayuki Takeda

We consider the communication complexity of the Hamming distance of two strings. Bille et al. [SPIRE 2018] considered the communication complexity of the longest common prefix (LCP) problem in the setting where the two parties have their strings in a compressed form, i.e., represented by the Lempel-Ziv 77 factorization (LZ77) with/without self-references. We present a randomized public-coin protocol for a joint computation of the Hamming distance of two strings represented by LZ77 without self-references. Although our scheme is heavily based on Bille et al.’s LCP protocol, our complexity analysis is original which uses Crochemore’s C-factorization and Rytter’s AVL-grammar. As a byproduct, we also show that LZ77 with/without self-references are not monotonic in the sense that their sizes can increase by a factor of 4/3 when a prefix of the string is removed.


2021 ◽  
Vol 115 ◽  
pp. 235-245
Author(s):  
Markus Lohrey ◽  
Sebastian Maneth

2021 ◽  
pp. 143-150
Author(s):  
Tomohiro I ◽  
Robert W. Irving ◽  
Dominik Köppl ◽  
Lorna Love

Author(s):  
Paola Bonizzoni ◽  
Clelia De Felice ◽  
Rocco Zaccagnino ◽  
Rosalba Zizza
Keyword(s):  

2020 ◽  
Vol 15 (1) ◽  
Author(s):  
Felipe A. Louza ◽  
Guilherme P. Telles ◽  
Simon Gog ◽  
Nicola Prezza ◽  
Giovanna Rosone

Abstract Background The construction of a suffix array for a collection of strings is a fundamental task in Bioinformatics and in many other applications that process strings. Related data structures, as the Longest Common Prefix array, the Burrows–Wheeler transform, and the document array, are often needed to accompany the suffix array to efficiently solve a wide variety of problems. While several algorithms have been proposed to construct the suffix array for a single string, less emphasis has been put on algorithms to construct suffix arrays for string collections. Result In this paper we introduce , an open source software for constructing the suffix array and related data indexing structures for a string collection with N symbols in O(N) time. Our tool is written in and is based on the algorithm gSACA-K (Louza et al. in Theor Comput Sci 678:22–39, 2017), the fastest algorithm to construct suffix arrays for string collections. The tool supports large fasta, fastq and text files with multiple strings as input. Experiments have shown very good performance on different types of strings. Conclusions is a fast, portable, and lightweight tool for constructing the suffix array and additional data structures for string collections.


SUAR BETANG ◽  
2019 ◽  
Vol 14 (2) ◽  
Author(s):  
Anggi Restiani ◽  
Agus Nero Sofyan

This research entitled “The Usage of Affixes on Lyrics Songs Tulus in The Album Monokrom: a Morphologycal Study.” The method used in this study is a qualitative method. The data are taken from the lyrics songs Tulus in the Album Monokrom that exist in the internet site and artificial data (made by the author).The theory are used Affixes, prefiks, sufiks, and Confixs.  Based on the research there is a lot of use of affixation in lyrics songs Tulus on the Monokrom album. The data are  grouped into 3, ie prefixed word, suffixes and confix.the prefix found in 58 data consists of prefixes ber-, me-, di-, and ter-. The most common prefix is ber- , whereas the prefix whose frequency of occurrence is the smallest is prefix di-. The suffix found in 44 data, consisting of suffix -kan, -an, -nya and -i. The most commonly found suffix is the suffix -kan, whereas the suffix with the least frequency of occurrences is the suffix -nya. The confix found in 8 data, consists of words that have confix ke-an and per-an.


2019 ◽  
Vol 30 (08) ◽  
pp. 1363-1379
Author(s):  
Lucas Mol ◽  
Narad Rampersad ◽  
Jeffrey Shallit ◽  
Manon Stipulanti

We make certain bounds in Krebs’ proof of Cobham’s theorem explicit and obtain corresponding upper bounds on the length of a common prefix of an aperiodic [Formula: see text]-automatic sequence and an aperiodic [Formula: see text]-automatic sequence, where [Formula: see text] and [Formula: see text] are multiplicatively independent. We also show that an automatic sequence cannot have arbitrarily large factors in common with a Sturmian sequence.


Author(s):  
Vipul Ajit Sansare ◽  
Abhijeet Mohan Kanavaje

Acne is a disfiguring disorder of the skin with significant cosmetic morbidity that may lead to serious psychological and social dysfunction. The skin disease comes in two forms. The most well-known form is Acne vulgaris (referred to as acne), which mostly manifests in teens but may continue into the early 20s. The second form is called Acne rosacea (referred to as rosacea) and mostly affects 30- to 60-year-olds. The two forms, despite sharing a common prefix, are quite unrelated in their respective pathophysiology, have different approaches to treatment and hence are considered two separate conditions. The conventional drug delivery system is efficient in the management of acne but poor patient compliance and adverse effects limit its efficacy. Lipid nanoparticles are novel nano lipid carriers made from biocompatible lipid which reduces toxicity; improve physical stability, skin hydration, and film formation. Furthermore, lipid nanoparticles protect the encapsulated drug from degradation. Thus current review focused on the potential use of lipid nanoparticles for the management of acne.


Sign in / Sign up

Export Citation Format

Share Document