Pages that link to "Item:Q396596"
From MaRDI portal
The following pages link to On the hardness of the consensus string problem (Q396596):
Displayed 6 items.
- An efficient algorithm to detect common ancestor genes for non-overlapping inversion and applications (Q507397) (← links)
- Two-string consensus problem under non-overlapping inversion and transposition distance (Q1679911) (← links)
- On the string consensus problem and the Manhattan sequence consensus problem (Q1698720) (← links)
- Consensus string problem for multiple regular languages (Q2042725) (← links)
- Consensus String Problem for Multiple Regular Languages (Q5738997) (← links)
- Closest substring problems for regular languages (Q5918147) (← links)