In this paper, we consider a generalized longest common subsequence problem, in which a constraining sequence of length s must be included as a substring and the other constraining sequence of length t must be excluded as a subsequence of two main sequences and the length of the result must be maximal. For the two input sequences X and Y of lengths n and m, and the given two constraining sequen...

In this paper, we consider a generalized longest common subsequence problem, in which a constraining sequence of length s must be included as a substring and the other constraining sequence of length t must be included as a subsequence of two main sequences and the length of the result must be maximal. For the two input sequences X and Y of lengths n and m, and the given two constraining sequen...

S of the Ghent Graph Theory Workshop on Longest Paths and Longest Cycles Kathie Cameron Degree-constrained spanning trees 2 Jan Goedgebeur Finding minimal obstructions to graph coloring 3 Jochen Harant On longest cycles in essentially 4-connected planar graphs 3 Frantǐsek Kardoš Barnette was right: not only fullerene graphs are Hamiltonian 4 Gyula Y. Katona Complexity questions for minimally t-...

in this work, the feasibility study for design of a laboratory sample rde which has an annular geometry with diameter of 76 mm and length of 101 mm has been performed. detonation engines are expected to be used as propulsion system in aerospace applications in the future. several types of detonation engines are currently under examination, including the rotating detonation engine (rde). first, ...

Background & Aim: Effects of ultra violet spectrum on plants due to their obligatory requirement for sunlight for survival are unavoidable. Direct effects of UV on plant growth and development are generally negative and usually they use many different defense mechanisms to acclimate and protect themselves. Material & Methods: The present research for the first time was conducted to investigate...

We consider repetitions in words and solve a longstanding open problem about the relation between the period of a word and the length of its longest unbordered factor (where factor means uninterrupted subword). A word u is called bordered if there exists a proper prefix that is also a suffix of u, otherwise it is called unbordered. In 1979 Ehrenfeucht and Silberger raised the following problem:...