Pages that link to "Item:Q1140992"
From MaRDI portal
The following pages link to On finding minimal length superstrings (Q1140992):
Displaying 50 items.
- The power of greedy algorithms for approximating Max-ATSP, cyclic cover, and superstrings (Q313766) (← links)
- Non-uniqueness of minimal superpermutations (Q389216) (← links)
- A probabilistic PTAS for shortest common superstring (Q393897) (← links)
- Recognition of overlap graphs (Q405660) (← links)
- Conjunctive query containment over trees (Q532363) (← links)
- Combined super-/substring and super-/subsequence problems (Q596093) (← links)
- Reoptimization of the shortest common superstring problem (Q639296) (← links)
- Shortest consistent superstrings computable in polynomial time (Q673640) (← links)
- On the complexity of learning strings and sequences (Q688167) (← links)
- Sequencing by hybridization with isothermic oligonucleotide libraries (Q705498) (← links)
- Computing a longest common subsequence for a set of strings (Q786541) (← links)
- Novel evolutionary models and applications to sequence alignment problems (Q863608) (← links)
- On the greedy algorithm for the shortest common superstring problem with reversals (Q903196) (← links)
- A linear-time algorithm for finding approximate shortest common superstrings (Q911299) (← links)
- A large neighborhood search heuristic for the longest common subsequence problem (Q953288) (← links)
- Why greed works for shortest common superstring problem (Q1038476) (← links)
- New algorithms for the LCS problem (Q1072704) (← links)
- Shortest common superstrings and scheduling with coordinated starting times (Q1127327) (← links)
- A note on shortest superstrings with flipping (Q1208439) (← links)
- A \(2_3^2\) superstring approximation algorithm (Q1281759) (← links)
- More on the complexity of common superstring and supersequence problems (Q1318686) (← links)
- Approximating shortest superstrings with constraints (Q1341729) (← links)
- Inferring a tree from walks (Q1351963) (← links)
- Complexity of DNA sequencing by hybridization. (Q1401172) (← links)
- Parameterized complexity of superstring problems (Q1679230) (← links)
- Conjunctive query containment over trees using schema information (Q1702301) (← links)
- Modified classical graph algorithms for the DNA fragment assembly problem (Q1736710) (← links)
- Relationship between superstring and compression measures: new insights on the greedy conjecture (Q1752482) (← links)
- Sequencing by hybridization with errors: handling longer sequences (Q1770409) (← links)
- Approximation algorithms for the shortest common superstring problem (Q1822981) (← links)
- Combinatorial algorithms for DNA sequence assembly (Q1902464) (← links)
- All instantiations of the greedy algorithm for the shortest common superstring problem are equivalent (Q2146125) (← links)
- Settlement fund circulation problem (Q2312652) (← links)
- A combinatorial approach to the design of vaccines (Q2339974) (← links)
- A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem (Q2344005) (← links)
- Computing minimum length representations of sets of words of uniform length (Q2355702) (← links)
- Solving SCS for bounded length strings in fewer than \(2^n\) steps (Q2448115) (← links)
- Computational complexity of isothermic DNA sequencing by hybridization (Q2489897) (← links)
- Tabu search algorithm for DNA sequencing by hybridization with isothermic libraries (Q2490605) (← links)
- A tissue \(P\) system and a DNA microfluidic device for solving the shortest common superstring problem (Q2576612) (← links)
- A linear time algorithm for shortest cyclic cover of strings (Q2628807) (← links)
- Superstring Graph: A New Approach for Genome Assembly (Q2830057) (← links)
- A survey on combinatorial optimization in dynamic environments (Q2907959) (← links)
- Computing Minimum Length Representations of Sets of Words of Uniform Length (Q2946043) (← links)
- On the Shortest Common Superstring of NGS Reads (Q2988815) (← links)
- (Q3143773) (← links)
- DNA sequencing and string learning (Q3445271) (← links)
- Why Greed Works for Shortest Common Superstring Problem (Q3506957) (← links)
- Reoptimization of the Shortest Common Superstring Problem (Q3637106) (← links)
- NC algorithms for finding a maximal set of paths with application to compressing strings (Q4645170) (← links)
