Search For:

Displaying 1-4 out of 4 total
A Space-Bounded Anytime Algorithm for the Multiple Longest Common Subsequence Problem
Found in: IEEE Transactions on Knowledge and Data Engineering
By Jiaoyun Yang,Yun Xu,Yi Shang,Guoliang Chen
Issue Date:November 2014
pp. 2599-2609
The multiple longest common subsequence (MLCS) problem, related to the identification of sequence similarity, is an important problem in many fields. As an NP-hard problem, its exact algorithms have difficulty in handling large-scale data and time- and spa...
 
A New Progressive Algorithm for a Multiple Longest Common Subsequences Problem and Its Efficient Parallelization
Found in: IEEE Transactions on Parallel and Distributed Systems
By Jiaoyun Yang,Yun Xu,Guangzhong Sun,Yi Shang
Issue Date:May 2013
pp. 862-870
The multiple longest common subsequence (MLCS) problem, which is related to the measurement of sequence similarity, is one of the fundamental problems in many fields. As an NP-hard problem, finding a good approximate solution within a reasonable time is im...
 
FNphasing: A Novel Fast Heuristic Algorithm for Haplotype Phasing Based on Flow Network Model
Found in: IEEE/ACM Transactions on Computational Biology and Bioinformatics
By Jiaoyun Yang,Yun Xu,Xiaohui Yao,Guoliang Chen
Issue Date:March 2013
pp. 372-382
An enormous amount of sequence data has been generated with the development of new DNA sequencing technologies, which presents great challenges for computational biology problems such as haplotype phasing. Although arduous efforts have been made to address...
 
FNphasing: A Novel Fast Heuristic Algorithm for Haplotype Phasing Based on Flow Network Model
Found in: IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
By Guoliang Chen, Jiaoyun Yang, Xiaohui Yao, Yun Xu
Issue Date:March 2013
pp. 372-382
An enormous amount of sequence data has been generated with the development of new DNA sequencing technologies, which presents great challenges for computational biology problems such as haplotype phasing. Although arduous efforts have been made to address...
     
 1