Log in

Relevant bibliographies by topics / Combinatorial algorithms on string

Contents

Journal articles

Academic literature on the topic 'Combinatorial algorithms on string'

Author: Grafiati

Published: 11 March 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Combinatorial algorithms on string.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Combinatorial algorithms on string"

1

Bernardini, Giulia, Huiping Chen, Alessio Conte, et al. "Combinatorial Algorithms for String Sanitization." ACM Transactions on Knowledge Discovery from Data 15, no. 1 (2021): 1–34. http://dx.doi.org/10.1145/3418683.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

TAKAOKA, TADAO, and STEPHEN VIOLICH. "FUSING LOOPLESS ALGORITHMS FOR COMBINATORIAL GENERATION." International Journal of Foundations of Computer Science 18, no. 02 (2007): 263–93. http://dx.doi.org/10.1142/s0129054107004681.

Full text

Abstract:

Some combinatorial generation problems can be broken into subproblems for which loopless algorithms already exist. This article discusses means by which loopless algorithms can be fused to produce a new loopless algorithm that solves the original problem. It demonstrates this method with two new loopless algorithms. The first generates well-formed parenthesis strings containing two different types of parentheses. The second generates multiset permutations in linear space using only arrays; it is simpler and more efficient than the recent algorithm of Korsh & LaFollette.

APA, Harvard, Vancouver, ISO, and other styles

3

Ambainis, Andris, and Ashley Montanaro. "Quantum algorithms for search with wildcards and combinatorial group testing." Quantum Information and Computation 14, no. 5&6 (2014): 439–53. http://dx.doi.org/10.26421/qic14.5-6-4.

Full text

Abstract:

We consider two combinatorial problems. The first we call ``search with wildcards'': given an unknown $n$-bit string $x$, and the ability to check whether any subset of the bits of $x$ is equal to a provided query string, the goal is to output $x$. We give a nearly optimal $O(\sqrt{n} \log n)$ quantum query algorithm for search with wildcards, beating the classical lower bound of $\Omega(n)$ queries. Rather than using amplitude amplification or a quantum walk, our algorithm is ultimately based on the solution to a state discrimination problem. The second problem we consider is combinatorial gr

APA, Harvard, Vancouver, ISO, and other styles

4

Moraglio, A., J. Togelius, and S. Silva. "Geometric Differential Evolution for Combinatorial and Programs Spaces." Evolutionary Computation 21, no. 4 (2013): 591–624. http://dx.doi.org/10.1162/evco_a_00099.

Full text

Abstract:

Geometric differential evolution (GDE) is a recently introduced formal generalization of traditional differential evolution (DE) that can be used to derive specific differential evolution algorithms for both continuous and combinatorial spaces retaining the same geometric interpretation of the dynamics of the DE search across representations. In this article, we first review the theory behind the GDE algorithm, then, we use this framework to formally derive specific GDE for search spaces associated with binary strings, permutations, vectors of permutations and genetic programs. The resulting a

APA, Harvard, Vancouver, ISO, and other styles

5

Nazeen, Sumaiya, M. Sohel Rahman, and Rezwana Reaz. "Indeterminate string inference algorithms." Journal of Discrete Algorithms 10 (January 2012): 23–34. http://dx.doi.org/10.1016/j.jda.2011.08.002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Graf, Alessandra, David G. Harris, and Penny Haxell. "Algorithms for Weighted Independent Transversals and Strong Colouring." ACM Transactions on Algorithms 18, no. 1 (2022): 1–16. http://dx.doi.org/10.1145/3474057.

Full text

Abstract:

An independent transversal (IT) in a graph with a given vertex partition is an independent set consisting of one vertex in each partition class. Several sufficient conditions are known for the existence of an IT in a given graph and vertex partition, which have been used over the years to solve many combinatorial problems. Some of these IT existence theorems have algorithmic proofs, but there remains a gap between the best existential bounds and the bounds obtainable by efficient algorithms. Recently, Graf and Haxell (2018) described a new (deterministic) algorithm that asymptotically closes t

APA, Harvard, Vancouver, ISO, and other styles

7

Hamad, Ibrahim Ismael, and Mohammad S. Hasan. "A Review: On using ACO Based Hybrid Algorithms for Path Planning of Multi-Mobile Robotics." International Journal of Interactive Mobile Technologies (iJIM) 14, no. 18 (2020): 145. http://dx.doi.org/10.3991/ijim.v14i18.16371.

Full text

Abstract:

<p class="0abstract"><strong>Abstract-</strong>The path planning for Multi Mobile Robotic (MMR) system is a recent combinatorial optimisation problem. In the last decade, many researches have been published to solve this problem. Most of these researches focused on metaheuristic algorithms. This paper reviews articles on Ant Colony Optimisation (ACO) and its hybrid versions to solve the problem. The original Dorigo’s ACO algorithm uses exploration and exploitation phases to find the shortest route in a combinatorial optimisation problem in general without touching mapping, lo

APA, Harvard, Vancouver, ISO, and other styles

8

Saud, Suhair, Halife Kodaz, and İsmail Babaoğlu. "Solving Travelling Salesman Problem by Using Optimization Algorithms." KnE Social Sciences 3, no. 1 (2018): 17. http://dx.doi.org/10.18502/kss.v3i1.1394.

Full text

Abstract:

This paper presents the performances of different types of optimization techniques used in artificial intelligence (AI), these are Ant Colony Optimization (ACO), Improved Particle Swarm Optimization with a new operator (IPSO), Shuffled Frog Leaping Algorithms (SFLA) and modified shuffled frog leaping algorithm by using a crossover and mutation operators. They were used to solve the traveling salesman problem (TSP) which is one of the popular and classical route planning problems of research and it is considered as one of the widely known of combinatorial optimization. Combinatorial optimizatio

APA, Harvard, Vancouver, ISO, and other styles

9

CLÉMENT, JULIEN, and LAURA GIAMBRUNO. "Representing prefix and border tables: results on enumeration." Mathematical Structures in Computer Science 27, no. 2 (2015): 257–76. http://dx.doi.org/10.1017/s0960129515000146.

Full text

Abstract:

For some text algorithms, the real measure for the complexity analysis is not the string itself but its structure stored in its prefix table or equivalently border table. In this paper, we define the combinatorial class of prefix lists, namely a sequence of integers together with their size, and an injection ψ from the class of prefix tables to the class of prefix lists. We call a valid prefix list the image by ψ of a prefix table. In particular, we describe algorithms converting a prefix/border table to a prefix list and inverse linear algorithms from computing from a prefix list L = ψ(P) two

APA, Harvard, Vancouver, ISO, and other styles

10

FONTAINE, MARC, STEFAN BURKHARDT, and JUHA KÄRKKÄINEN. "BDD-BASED ANALYSIS OF GAPPED q-GRAM FILTERS." International Journal of Foundations of Computer Science 16, no. 06 (2005): 1121–34. http://dx.doi.org/10.1142/s0129054105003698.

Full text

Abstract:

Recently, there has been a surge of interest in gapped q-gram filters for approximate string matching. Important design parameters for filters are for example the value of q, the filter-threshold and in particular the shape (aka seed) of the filter. A good choice of parameters can improve the performance of a q-gram filter by orders of magnitude and optimizing these parameters is a nontrivial combinatorial problem. We describe a new method for analyzing gapped q-gram filters. This method is simple and generic. It applies to a variety of filters, overcomes many restrictions that are present in

APA, Harvard, Vancouver, ISO, and other styles

More sources

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!