- Applied mathematics
- >
- Theoretical computer science
- >
- Algorithms
- >
- Algorithms on strings

- Applied mathematics
- >
- Theoretical computer science
- >
- Formal languages
- >
- Algorithms on strings

- Combinatorics
- >
- Combinatorics on words
- >
- Formal languages
- >
- Algorithms on strings

- Deductive reasoning
- >
- Metalogic
- >
- Formal languages
- >
- Algorithms on strings

- Fields of mathematics
- >
- Applied mathematics
- >
- Algorithms
- >
- Algorithms on strings

- Fields of mathematics
- >
- Mathematical logic
- >
- Algorithms
- >
- Algorithms on strings

- Fields of mathematics
- >
- Mathematical logic
- >
- Formal languages
- >
- Algorithms on strings

- Mathematical analysis
- >
- Sequences and series
- >
- String (computer science)
- >
- Algorithms on strings

- Mathematical structures
- >
- Sequences and series
- >
- String (computer science)
- >
- Algorithms on strings

- Philosophy of mathematics
- >
- Formalism (deductive)
- >
- Formal languages
- >
- Algorithms on strings

- Philosophy of mathematics
- >
- Mathematical logic
- >
- Algorithms
- >
- Algorithms on strings

- Philosophy of mathematics
- >
- Mathematical logic
- >
- Formal languages
- >
- Algorithms on strings

- Type systems
- >
- Data types
- >
- String (computer science)
- >
- Algorithms on strings

Jewels of Stringology

Jewels of Stringology: Text Algorithms is a book on algorithms for pattern matching in strings and related problems. It was written by Maxime Crochemore and Wojciech Rytter, and published by World Sci

Substring index

In computer science, a substring index is a data structure which gives substring search in a text or text collection in sublinear time. If you have a document of length , or a set of documents of tota

Wagner–Fischer algorithm

In computer science, the Wagner–Fischer algorithm is a dynamic programming algorithm that computes the edit distance between two strings of characters.

BCJ (algorithm)

In data compression, BCJ, short for Branch/Call/Jump, refers to a technique that improves the compression of machine code by replacing relative branch addresses with absolute ones. This allows a Lempe

String kernel

In machine learning and data mining, a string kernel is a kernel function that operates on strings, i.e. finite sequences of symbols that need not be of the same length. String kernels can be intuitiv

Ukkonen's algorithm

In computer science, Ukkonen's algorithm is a linear-time, online algorithm for constructing suffix trees, proposed by Esko Ukkonen in 1995. The algorithm begins with an implicit suffix tree containin

String generation

In computer science, string generation is the process of creating a set of strings from a collection of rules. This is an opposite process to that of parsing, which recognises a string based on some c

Parsing

Parsing, syntax analysis, or syntactic analysis is the process of analyzing a string of symbols, either in natural language, computer languages or data structures, conforming to the rules of a formal

Hunt–Szymanski algorithm

In computer science, the Hunt–Szymanski algorithm, also known as Hunt–McIlroy algorithm, is a solution to the longest common subsequence problem. It was one of the first non-heuristic algorithms used

String (computer science)

In computer programming, a string is traditionally a sequence of characters, either as a literal constant or as some kind of variable. The latter may allow its elements to be mutated and the length ch

Suffix automaton

In computer science, a suffix automaton is an efficient data structure for representing the substring index of a given string which allows the storage, processing, and retrieval of compressed informat

Sequence alignment

In bioinformatics, a sequence alignment is a way of arranging the sequences of DNA, RNA, or protein to identify regions of similarity that may be a consequence of functional, structural, or evolutiona

© 2023 Useful Links.