Pages that link to "Item:Q4857599"
From MaRDI portal
The following pages link to On the Approximation of Shortest Common Supersequences and Longest Common Subsequences (Q4857599):
Displaying 6 items.
- A learning algorithm for the longest common subsequence problem (Q5463438) (← links)
- Listing Center Strings Under the Edit Distance Metric (Q5743548) (← links)
- On the complexity of comparing evolutionary trees (Q5961623) (← links)
- (Q6084394) (← links)
- Weighted shortest common supersequence problem revisited (Q6536257) (← links)
- Algorithms and hardness for the longest common subsequence of three strings and related problems (Q6545446) (← links)