Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 1,652 papers for “Substring”

SubString: SubString 0.9.9

Andy Buerki · Zenodo (CERN European Organization for Nuclear Research) · 2016

release notes v. 0.9.9 substring.sh added a menu-based interface moved main processing code to new substring-processor.sh Added the following auxiliary scripts used by substring.sh consolidate.sh en-filter.sh random_lines.sh TP-filter.sh substring-processor.sh listconv.sh script was retired as the NGP package now provides suitably formatted input files. Removed awk commands from all scripts due to compatibility issues with Cygwin in certain configurations Adjusted the following to reflect above changes install.sh README.pdf/README.md: test_data

Cited by 0Open access

buerki/SubString: SubString 0.9.9.2

Buerki, Andy · Zenodo (CERN European Organization for Nuclear Research) · 2017

release notes v. 0.9.9.2 substring-processor.sh raised limit of number of uncut lists to be incorporated in the consolidation to 12. TP-filter.sh added option to rate on a scale from 1 to 6 rather than a binary T/F distinction.

Cited by 0Open access

Substring Languages

2008

Abstract. This paper investigates the concept of substring languages as an alternative to the traditional parsing scheme. Practical grounds are also presented. Then the properties of substring languages are investigated. The paper proposes the most rudimentary characteristics of substring languages and relations of this concept to classes: REG, CFL, REC and REL. Finally, the map of problem solutions in substring sense is presented.

Cited by 0

Substring languages

Atłasiewicz, Krzysztof · Jagiellonian University Repository (Jagiellonian University) · 2004

This paper investigates the concept of substring languages as an alternative to the traditional parsing scheme.Practical grounds are also presented.Then the properties of substring languages are in vestigated.The paper proposes the most rudimentary characteristics of substring languages and relations of this concept to classes: 1ZQ, CJ-C, 1ZC and 11SC.Finally, the map of problem solutions in substring sense is presented.

Cited by 0Open access

Substring-MPPT for 4-Terminal 3-Substring Modules

Brace, R., Neumann, A., Czarnecki, T. et al. · EU PVSEC · 2018

State of the art residential photovoltaic (PV) systems are sensitive to partial shading. Shaded modules subjected to lower solar irradiance result in lower current in a PV-string. To minimize power losses string inverters activate bypass diodes in a shaded module resulting in unused power potential. Common module-based power optimizers (MPO) or module inverters lead to mismatch losses in shaded PV-modules. Individual substring maximum power point tracking minimizes mismatch and shading losses for a partially shaded module, resulting in a higher shaded module power output compared to MPOs and bypass diodes. A first unoptimized Substring-MPPT prototype adapted to one substring shaded by 25 % and another one shaded by 30 % raises the output power from 34 % of the theoretical maximum to 90 % whilst avoiding hotspot generation.

Cited by 0Open access

Substring selectivity estimation

Hongrae Lee, Raymond T. Ng, Kyuseok Shim · 1999

We study the problem of estimating selectivity of approximate substring queries. Its importance in databases is ever increasing as more and more data are input by users and are integrated with many typographical errors and different spelling conventions. To begin with, we consider edit distance for the similarity between a pair of strings. Based on information stored in an extended N-gram table, we propose two estimation algorithms, MOF and LBS for the task. The latter extends the former with ideas from set hashing signatures. The experimental results show that MOF is a light-weight algorithm that gives fairly accurate estimations. However, if more space is available, LBS can give better accuracy than MOF and other baseline methods. Next, we extend the proposed solution to other similarity predicates, SQL LIKE operator and Jaccard similarity. 1.

Cited by 0

Substring Range Reporting

Philip Bille, Inge Li Goertz · arXiv (Cornell University) · 2011

We revisit various string indexing problems with range reporting features, namely, position-restricted substring searching, indexing substrings with gaps, and indexing substrings with intervals. We obtain the following main results. {itemize} We give efficient reductions for each of the above problems to a new problem, which we call \emph{substring range reporting}. Hence, we unify the previous work by showing that we may restrict our attention to a single problem rather than studying each of the above problems individually. We show how to solve substring range reporting with optimal query time and little space. Combined with our reductions this leads to significantly improved time-space trade-offs for the above problems. In particular, for each problem we obtain the first solutions with optimal time query and $O(n\log^{O(1)} n)$ space, where $n$ is the length of the indexed string. We show that our techniques for substring range reporting generalize to \emph{substring range counting} and \emph{substring range emptiness} variants. We also obtain non-trivial time-space trade-offs for these problems. {itemize} Our bounds for substring range reporting are based on a novel combination of suffix trees and range reporting data structures. The reductions are simple and general and may apply to other combinations of string indexing with range reporting.

Cited by 13Open access

FOR BLIND SUBSTRING SEARCH

Matthew Skala · 2008

Applications are described for “blind substring search, ” where a program to search files for a substring is published without revealing the substring. The “limited diffusion ” approach proposed in a previous article is described. Design criteria for a Boolean function to be used in the limited diffusion algorithm are stated, and a function meeting the criteria is proposed. An algorithm for blind substring search is developed and discussed.

Cited by 0

M.: Generalized substring compression

Orgad Keller, Tsvi Kopelowitz, Shir Landau et al. · 2009

In substring compression one is given a text to preprocess so that, upon request, a compressed substring is returned. Generalized substring compression is the same with the following twist. The queries contain an additional context substring (or a collection of context substrings) and the answers are the substring in compressed format, where the context substring is used to make the compression more efficient. We focus our attention on generalized substring compression and present the first non-trivial correct algorithm for this problem. In our algorithm we inherently propose a method for finding the bounded longest common prefix of substrings, which may be of independent interest. In addition, we propose an efficient algorithm for substring compression which makes use of range searching for minimum queries. We present several tradeoffs for both problems. For compressing the substring S[i.. j] (possibly with the substring S[α.. β] as a context), best query times we achieve are O(C) and O ( C log ()) j−i C for substring compression query and generalized substring compression query, respectively, where C is the number of phrases encoded. 1

Cited by 0

Substring Differences in Genomes ∗

Hendrik Jan, Hoogeboom Walter, A. Kosters et al. · 2008

We introduce a new way of determining the difference between full genomes, based upon the occurrence of small substrings in both genomes. Basically we count the number of occurrences of all substrings of a certain length and use that to determine to what extent two genomes are alike. Based on these numbers several difference measures can be defined, e.g., a Euclidean distance in the vector space that has the same dimension as the number of possible substrings of a certain length, a multiset distance, or other measures. Each of these measures can be applied for phylogenetic tree generation. We also pay attention to some visualizations and several statistics. 1

Cited by 0