8 citations · 16 across the 14 of their papers we have counts for
17 papers
The Longest Subsequence-Repeated Subsequence Problem
Manuel Lafond, Wenfeng Lai, Adiesha Liyanage +1
Motivated by computing duplication patterns in sequences, a new fundamental problem called the longest subsequence-repeated subsequence (LSRS) is proposed. Given a sequence of…
The Two-Squirrel Problem and Its Relatives
Sergey Bereg, Yuya Higashikawa, Naoki Katoh +3
In this paper, we start with a variation of the star cover problem called the Two-Squirrel problem. Given a set of points in the plane, and two sites and , comp…
Men Can't Always be Transformed into Mice: Decision Algorithms and Complexity for Sorting by Symmetric Reversals
Xin Tong, Yixiao Yu, Ziyi Fang +4
Sorting a permutation by reversals is a famous problem in genome rearrangements. Since 1997, quite some biological evidence were found that in many genomes the reversed regions are…
Beyond the Longest Letter-duplicated Subsequence Problem
Wenfeng Lai, Adiesha Liyanage, Binhai Zhu +1
Given a sequence of length , a letter-duplicated subsequence is a subsequence of in the form of with , an…
Optimal Grain Mixing is NP-Complete
Md Asaduzzaman Noor, Sean Yaw, Binhai Zhu +1
Protein content in wheat plays a significant role when determining the price of wheat production. The Grain mixing problem aims to find the optimal bin pair combination with an app…
Genomic Problems Involving Copy Number Profiles: Complexity and Algorithms
Manuel Lafond, Binhai Zhu, Peng Zou
Recently, due to the genomic sequence analysis in several types of cancer, the genomic data based on {\em copy number profiles} ({\em CNP} for short) are getting more and more popu…