Pages that link to "Item:Q4229812"

The following pages link to Algorithms on Strings, Trees and Sequences (Q4229812):

Displaying 50 items.

• The shortest path problem with forbidden paths (Q146692) (← links)
• Discovery of stop regions for understanding repeat travel behaviors of moving objects (Q252706) (← links)
• Space-efficient substring occurrence estimation (Q261345) (← links)
• Polynomial-time approximation algorithms for weighted LCS problem (Q266804) (← links)
• Models and algorithms for competitive facility location problems with different customer behavior (Q276530) (← links)
• On del-robust primitive words (Q277635) (← links)
• Finding the leftmost critical factorization on unordered alphabet (Q290524) (← links)
• Longest common extensions in trees (Q294947) (← links)
• FM-index of alignment: a compressed index for similar strings (Q294964) (← links)
• Linear-size suffix tries (Q294967) (← links)
• DCA based algorithms for multiple sequence alignment (MSA) (Q301241) (← links)
• A multiobjective optimization algorithm for the weighted LCS (Q313763) (← links)
• The power of greedy algorithms for approximating Max-ATSP, cyclic cover, and superstrings (Q313766) (← links)
• Sequence binary decision diagram: minimization, relationship to acyclic automata, and complexities of Boolean set operations (Q313770) (← links)
• Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization (Q342297) (← links)
• Non-expandable non-overlapping sets of pictures (Q346246) (← links)
• Compressed directed acyclic word graph with application in local alignment (Q378207) (← links)
• \textsc{FlipCut} supertrees: towards matrix representation accuracy in polynomial time (Q378228) (← links)
• Palindrome pattern matching (Q390901) (← links)
• Versatile string kernels (Q391141) (← links)
• A probabilistic PTAS for shortest common superstring (Q393897) (← links)
• On-line construction of position heaps (Q396632) (← links)
• On parsing optimality for dictionary-based text compression -- the \texttt{Zip} case (Q396650) (← links)
• The structural border array (Q396695) (← links)
• Algorithms for path-constrained sequence alignment (Q396718) (← links)
• Reverse engineering of compact suffix trees and links: a novel algorithm (Q405568) (← links)
• A subquadratic algorithm for minimum palindromic factorization (Q405573) (← links)
• Counting distinct palindromes in a word in linear time (Q407601) (← links)
• An algorithm for mapping short reads to a dynamically changing genomic sequence (Q414417) (← links)
• Searching for smallest grammars on large sequences and application to DNA (Q414452) (← links)
• On-line suffix tree construction with reduced branching (Q414471) (← links)
• Towards a theory of patches (Q414472) (← links)
• Ultra-succinct representation of ordered trees with applications (Q414928) (← links)
• Approximate all-pairs suffix/prefix overlaps (Q418172) (← links)
• Efficient retrieval of approximate palindromes in a run-length encoded string (Q428850) (← links)
• Quadratic-time algorithm for a string constrained LCS problem (Q436553) (← links)
• PSIST: a scalable approach to indexing protein structures using suffix trees (Q436643) (← links)
• A parallel strategy for biological sequence alignment in restricted memory space (Q436758) (← links)
• Parameterized longest previous factor (Q441845) (← links)
• Efficient chaining of seeds in ordered trees (Q450556) (← links)
• Graph clustering (Q458448) (← links)
• Textual data compression in computational biology: algorithmic techniques (Q465689) (← links)
• Reconstruction of a word from a finite set of its subwords under the unit shift hypothesis. I. Reconstruction without forbidden words (Q466028) (← links)
• The pseudopalindromic completion of regular languages (Q476182) (← links)
• A PTAS for the square tiling problem (Q476839) (← links)
• A simple yet time-optimal and linear-space algorithm for shortest unique substring queries (Q476914) (← links)
• Alphabet-independent algorithms for finding context-sensitive repeats in linear time (Q491149) (← links)
• \(k\)-abelian pattern matching (Q491150) (← links)
• On the generalized constrained longest common subsequence problems (Q491203) (← links)
• Restricted and swap common superstring: a multivariate algorithmic perspective (Q494787) (← links)