Corpus ID: 16430786

Consistent Supersequences and Transversal Graphs: an Extended Abstract

@inproceedings{Middendorf1998ConsistentSA,
  title={Consistent Supersequences and Transversal Graphs: an Extended Abstract},
  author={M. Middendorf and VADIM G. TIMKOVSKYthe},
  year={1998}
}
  • M. Middendorf, VADIM G. TIMKOVSKYthe
  • Published 1998
  • 1. Motivation. A consistent supersequence is a common supersequence of the set of positive strings and a common nonsupersequence of the set of negative strings. Diierent problems related to consistent supersequences nd applications in molecular biology, learning theory, data compression, manufacturing systems design and draw attention due to their attractive combinatorial structure and challenging complexity aspect. Jiang and Li JL92] were probably the rst to study the complexity of the… CONTINUE READING

    References

    SHOWING 1-6 OF 6 REFERENCES
    Consistent Subsequences and Supersequences
    • C. Fraser
    • Mathematics, Computer Science
    • Theor. Comput. Sci.
    • 1996
    • 4
    • PDF
    Shortest Consistent Superstrings Computable in Polynomial Time
    • 7
    • PDF
    On Finding Minimal, Maximal, and Consistent Sequences over a Binary Alphabet
    • M. Middendorf
    • Mathematics, Computer Science
    • Theor. Comput. Sci.
    • 1995
    • 15
    Theory and Algorithms for Plan Merging
    • 171
    On the complexity of learning strings and sequences
    • 29
    On the approximation of longest common nonsupersequences and shortest commonnonsubsequences , Theoret
    • Comput . Sci .
    • 1995