The following pages link to Eric Rivals (Q313765):
Displayed 26 items.
- The power of greedy algorithms for approximating Max-ATSP, cyclic cover, and superstrings (Q313766) (← links)
- Reverse engineering of compact suffix trees and links: a novel algorithm (Q405568) (← links)
- Longest common subsequence problem for unoriented and cyclic strings (Q868937) (← links)
- Hardness of optimal spaced seed design (Q931726) (← links)
- (Q1276257) (redirect page) (← links)
- Optimal representation in average using Kolmogorov complexity (Q1276258) (← links)
- Combinatorics of periods in strings. (Q1417950) (← links)
- Relationship between superstring and compression measures: new insights on the greedy conjecture (Q1752482) (← links)
- Hierarchical overlap graph (Q2281159) (← links)
- Linking indexing data structures to de Bruijn graphs: construction and update (Q2424683) (← links)
- Hardness results for the center and median string problems under the weighted and unweighted edit distances (Q2569417) (← links)
- A linear time algorithm for shortest cyclic cover of strings (Q2628807) (← links)
- (Q2723967) (← links)
- Construction of a de Bruijn Graph for Assembly from a Truncated Suffix Tree (Q2799166) (← links)
- Superstring Graph: A New Approach for Genome Assembly (Q2830057) (← links)
- A SURVEY ON ALGORITHMIC ASPECTS OF TANDEM REPEATS EVOLUTION (Q3021996) (← links)
- Complexities of the Centre and Median String Problems (Q3550844) (← links)
- (Q4535051) (← links)
- On the Distribution of the Number of Missing Words in Random Texts (Q4796727) (← links)
- (Q5088915) (← links)
- Practical lower and upper bounds for the Shortest Linear Superstring (Q5140730) (← links)
- Superstrings with multiplicities (Q5140785) (← links)
- From Indexing Data Structures to de Bruijn Graphs (Q5165595) (← links)
- Tiling an Interval of the Discrete Line (Q5307499) (← links)
- Combinatorial Pattern Matching (Q5713536) (← links)
- (Q6098795) (← links)