Skip to main content
Springer Nature Link
Log in

Parameterized Algorithms for Minimum Tree Cut/Paste Distance and Minimum Common Integer Partition

  • Conference paper
  • First Online:
Frontiers in Algorithmics (FAW 2018)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10823))

Included in the following conference series:

Abstract

We study two NP-hard problems formulated in computational biology. The minimum tree cut/paste distance problem asks for the minimum number of cut/paste operations we need to apply to transform a tree to another tree. The minimum common integer partition problem asks for a minimum-cardinality integer partition of a number that refines two given integer partitions of the same number. We give parameterized algorithms for both problems.

This work is supported by the National Natural Science Foundation of China under Grants (61420106009, 61232001, 61472449, 61672536).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Boston (1974)

    MATH  Google Scholar 

  2. Bulteau, L., Komusiewicz, C.: Minimum common string partition parameterized by partition size is fixed-parameter tractable. In: Chekuri, C. (ed.) Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 102–121. SIAM (2014). https://doi.org/10.1137/1.9781611973402.8

  3. Chen, X., Liu, L., Liu, Z., Jiang, T.: On the minimum common integer partition problem. ACM Trans. Algorithms, 5(1), article no, 12 (2008). https://doi.org/10.1145/1435375.1435387

  4. Chen, X., Zheng, J., Fu, Z., Nan, P., Zhong, Y., Lonardi, S., Jiang, T.: Assignment of orthologous genes via genome rearrangement. IEEE/ACM Trans. Comput. Biol. Bioinform. 2(4), 302–315 (2005). https://doi.org/10.1145/1100863.1100950

    Article  Google Scholar 

  5. Damaschke, P.: Minimum common string partition parameterized. In: Crandall, K.A., Lagergren, J. (eds.) WABI 2008. LNCS, vol. 5251, pp. 87–98. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-87361-7_8

    Chapter  Google Scholar 

  6. DasGupta, B., He, X., Jiang, T., Li, M., Tromp, J., Wang, L., Zhang, L.: Computing distances between evolutionary trees. In: Pardalos, P.M., Du, D.-Z., Graham, R.L. (eds.) Handbook of Combinatorial Optimization, pp. 747–781. Springer, New York (2013). https://doi.org/10.1007/978-1-4419-7997-1_52

    Chapter  Google Scholar 

  7. Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Undergraduate Texts in Computer Science. Springer, Heidelberg (2013). https://doi.org/10.1007/978-1-4471-5559-1

    Book  MATH  Google Scholar 

  8. Finden, C.R., Gordon, A.D.: Obtaining common pruned trees. J. Classif. 2(1), 255–276 (1985)

    Article  Google Scholar 

  9. Zheng, F., Chen, X., Vacic, V., Nan, P., Zhong, Y., Jiang, T.: MSOAR: a high-throughput ortholog assignment system based on genome rearrangement. J. Comput. Biol. 14(9), 1160–1175 (2007). https://doi.org/10.1089/cmb.2007.0048. A preliminary version appeared in RECOMB 2006

    Article  MathSciNet  Google Scholar 

  10. Jiang, H., Zhu, B., Zhu, D., Zhu, H.: Minimum common string partition revisited. J. Comb. Optim. 23(4), 519–527 (2012). https://doi.org/10.1007/s10878-010-9370-2

    Article  MathSciNet  MATH  Google Scholar 

  11. Kirkpatrick, B., Reshef, Y., Finucane, H., Jiang, H., Zhu, B., Karp, R.M.: Comparing pedigree graphs. J. Comput. Biol. 19(9), 998–1014 (2012). https://doi.org/10.1089/cmb.2011.0254

    Article  MathSciNet  Google Scholar 

  12. Tai, K.-C.: The tree-to-tree correction problem. J. ACM 26(3), 422–433 (1979). https://doi.org/10.1145/322139.322143

    Article  MathSciNet  MATH  Google Scholar 

  13. Tong, W., Lin, G.: An improved approximation algorithm for the minimum common integer partition problem. In: Ahn, H.-K., Shin, C.-S. (eds.) ISAAC 2014. LNCS, vol. 8889, pp. 353–364. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-13075-0_28

    Google Scholar 

  14. Woodruff, D.P.: Better approximations for the minimum common integer partition problem. In: Díaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds.) APPROX/RANDOM -2006. LNCS, vol. 4110, pp. 248–259. Springer, Heidelberg (2006). https://doi.org/10.1007/11830924_24

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Information Science and Engineering, Central South University, Changsha, China

    Jie You, Jianxin Wang & Qilong Feng

Authors
  1. Jie You
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jianxin Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Qilong Feng
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Jie You or Jianxin Wang .

Editor information

Editors and Affiliations

  1. Texas A&M University, College Station, Texas, USA

    Jianer Chen

  2. Shanghai University of Finance and Economics, Shanghai, China

    Pinyan Lu

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

You, J., Wang, J., Feng, Q. (2018). Parameterized Algorithms for Minimum Tree Cut/Paste Distance and Minimum Common Integer Partition. In: Chen, J., Lu, P. (eds) Frontiers in Algorithmics. FAW 2018. Lecture Notes in Computer Science(), vol 10823. Springer, Cham. https://doi.org/10.1007/978-3-319-78455-7_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-78455-7_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-78454-0

  • Online ISBN: 978-3-319-78455-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation