The following pages link to (Q5616735):
Displayed 50 items.
- Algebraic dynamic programming for multiple context-free grammars (Q301600) (← links)
- Parsing by matrix multiplication generalized to Boolean grammars (Q385966) (← links)
- Conjunctive and Boolean grammars: the true general case of the context-free grammars (Q394967) (← links)
- Worst-case efficient single and multiple string matching on packed texts in the word-RAM model (Q450552) (← links)
- Fast searching in packed strings (Q533408) (← links)
- A sum-over-paths extension of edit distances accounting for all sequence alignments (Q632613) (← links)
- A fast output-sensitive algorithm for Boolean matrix multiplication (Q634680) (← links)
- Parallel detection of all palindromes in a string (Q673783) (← links)
- On the calculation of transitive reduction-closure of orders (Q686479) (← links)
- A new efficient algorithm for computing the longest common subsequence (Q733720) (← links)
- A note on Boolean matrix multiplication (Q761038) (← links)
- Computing a longest common subsequence for a set of strings (Q786541) (← links)
- Speeding up HMM decoding and training by exploiting sequence repetitions (Q834590) (← links)
- An O(NP) sequence comparison algorithm (Q912628) (← links)
- Algorithms for computing variants of the longest common subsequence problem (Q932321) (← links)
- New efficient algorithms for the LCS and constrained LCS problems (Q963324) (← links)
- Fast multiplication of matrices over a finitely generated semiring (Q963453) (← links)
- The Mailman algorithm: a note on matrix-vector multiplication (Q976066) (← links)
- Efficient algorithms for clique problems (Q976087) (← links)
- Semi-local longest common subsequences in subquadratic time (Q1002102) (← links)
- Matching subsequences in trees (Q1026243) (← links)
- An \(O(n^{3}\log \log n/\log n)\) time algorithm for the all-pairs shortest path problem (Q1044727) (← links)
- New algorithms for the LCS problem (Q1072704) (← links)
- An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs (Q1075771) (← links)
- Data structures and algorithms for approximate string matching (Q1104103) (← links)
- A practical algorithm for Boolean matrix multiplication (Q1111377) (← links)
- A faster algorithm computing string edit distances (Q1140994) (← links)
- The string merging problem (Q1154285) (← links)
- A sensitive transitive closure algorithm (Q1156488) (← links)
- Two fast simulations which imply some fast string matching and palindrome-recognition algorithms (Q1226857) (← links)
- On computing the transitive closure of a relation (Q1235010) (← links)
- A constant update time finger search tree (Q1338781) (← links)
- Recognizing quasi-triangulated graphs. (Q1428566) (← links)
- An improved combinatorial algorithm for Boolean matrix multiplication (Q1640996) (← links)
- EERTREE: an efficient data structure for processing palindromes in strings (Q1678105) (← links)
- An efficient algorithm for LCS problem between two arbitrary sequences (Q1720875) (← links)
- A simple linear-space data structure for constant-time range minimum query (Q1740692) (← links)
- An improved transitive closure algorithm (Q1836309) (← links)
- On the number of ANDs versus the number of ORs in monotone Boolean circuits (Q1847364) (← links)
- Partially local multi-way alignments (Q1993381) (← links)
- Improved normal form for grammars with one-sided contexts (Q2348260) (← links)
- Deposition and extension approach to find longest common subsequence for thousands of long sequences (Q2359328) (← links)
- Fast and compact regular expression matching (Q2378530) (← links)
- A hardness result and new algorithm for the longest common palindromic subsequence problem (Q2410574) (← links)
- Orthogonal range searching in moderate dimensions: k-d trees and range trees strike back (Q2415385) (← links)
- Towards optimal packed string matching (Q2437754) (← links)
- Complexity of the path avoiding forbidden pairs problem revisited (Q2446333) (← links)
- All-pairs shortest paths with real weights in \(O ( n^{3}/\log n )\) time (Q2480908) (← links)
- Fast matrix decomposition in \(\mathbb F_2\) (Q2511223) (← links)
- Efficient determination of the transitive closure of a directed graph (Q2547483) (← links)