A novel greedy algorithm for the minimum common string partition problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4463 LNBI, Issue , 2007, Pages 441-452

  Dan, He ^a  

^a University of Vermont   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; BIOINFORMATICS; CODES (SYMBOLS); PROBLEM SOLVING;

GREEDY ALGORITHM; MINIMUM COMMON STRING PARTITION (MCSP); SUBSTRING;

APPROXIMATION ALGORITHMS;

EID: 34547482415     PISSN: 03029743     EISSN: 16113349     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (9)

1. X. Chen, J. Zheng, Z. Fu, P. Nan, Y. Zhong, S. Lonardi and T. Jiang. Computing the assignment of orthologous genes via genome rearrangement. Proc. of Asia Pacific Bioinformatics Conference 2005, Jan 18-20, pp. 363-378, 2005.
2. A. Goldstein, P. Kolman, J. Zheng. Minimum common string partition problem: hardness and approximation. Proc. of International Symposium on Algorithms and Computation (ISAAC04), pp.484-495, LNCS 3341, Hong Kong, China, 2004.
3. M. Chrobak, P. Kolman, J. Sgall. A greedy algorithm for the minimum common string partition problem. Proc. 7th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX'04), LNCS 3122, Springer 2004, pp. 84-95.
4. G. Cormode, J.A. Muthukrishnan. The string edit distance matching with moves. Proc. 13th Annual Symposium on Discrete Algorithms (SODA), pp. 667-676, 2002
5. J.B. Kruskal and D. Snakoff. An anthology of algorithms and concepts for sequence comparision. In Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison, Edited by David SankofF and Joseph B. Kruskal, Addison-Wesley, 1983.
6. D. Lopresti, A. Tomkins. Block edit models for approximate string matching. Theoretical Computer Science 181, pp. (159-179) 1997.
7. D. Shapira, J.A. Storer. Edit distance with move operations. Proc. 13th Annual Symposium on Combinatorial Pattern Matching (CPM), pp. 85-98, 2002.
8. W.F. Tichy. The string-to-string correction problem with block moves. ACM Trans. Computer Systems 2, pp. (309-321) 1984.
9. G.A. Watterson, W.J. Ewens, T.E.Hall, and A. Morgan. The chromosome inversion problem. J. of Theoretical Biology, 99: 1-7 1982.