| 7 | 0 | 35 |
| 下载次数 | 被引频次 | 阅读次数 |
带标号有序森林比对问题旨在快速、准确比对出带标号有序森林最相似部分,为数据结构比对提供参考。局部森林相似度是解决森林比对问题的重要算法理论。本研究将局部序列相似度与带权最长公共子序列算法进行结合,提出一种基于无分数惩罚删除完整子树的局部森林相似度的算法,能够快速比对出数据结构中最相似的核心区域。该算法有望为疾病机制与药物研发及合成生物学设计提供参考。
Abstract:The ordered labeled forest matching problem aims to rapidly and accurately identify the most similar segments within ordered labeled forests, thereby establishing a theoretical foundation for data structure comparison. Local forest similarity is a core algorithmic theory for addressing forest matching tasks. By integrating local sequence similarity with the weighted longest common subsequence algorithm, this paper proposes a local forest similarity algorithm with penalty-free deletion of complete subtrees. The proposed algorithm enables efficient extraction of the most similar core regions embedded in data structures. Its application is expected to provide references for disease mechanism research, drug discovery and development, and synthetic biology design.
[1] Shapiro B A,Zhang Kaizhong.Comparing multiple RNA secondary structures using tree comparisons[J].Bioinformatics,1990,6(4):309-318.
[2] Jiang Tao,Wang Lusheng,Zhang Kaizhong.Alignment of trees-an alternative to tree edit[J].Theoretical Computer Science,1995,143(1):137-148.
[3] Zhang Kaizhong.Omputing similarity between RNA secondary structures[C]//IEEE International Joint Symposia on Intelligence and Systems (Cat.No.98EX174).Rockville,MD,USA:IEEE,1998:126-132.
[4] Ma Bin,Wang Lusheng,Zhang Kaizhong.Algorithms for forest pattern matching[C]//In Proceedings of the 21th Symposium on Combinatorial Pattern Matching,2010:1-12.
[5] Moulton V,Spillner A.Spaces of ranked tree-child networks[J].Journal of Mathematical Biology,2025,91(3):32.DOI:10.1007/s00285-025-02265-2.
[6] Selivanov V,Smirnov I.Ordinal invariants of the h-preorder on k-labeled forests[C]//Crossroads of Computability and Logic:Insights,Inspirations,and Innovations(CiE 2025),Cham:Springer,2025:15764.
[7] Li Yanzhi,Zhang Wenjie,Chen Tingting.Improved bounds for codes over trees[J].Improved Bounds for Codes Over Trees,2026,94(1):21.DOI:10.1007/s10623-025-01741-6.
[8] Ghafoor M,Tatsuya A.Designing ReLU generative networks to enumerate trees with a given tree edit distance[PP/OL].arXiv,(2026-02-03) [2026-03-11].https://arxiv.org/pdf/2510.10706.
[9] Demaine E D,Mozes S,Rossman B.An optimal decomposition algorithm for tree edit distance[J].ACM Transactions on Algorithms (TALG),2007,6(1):1-19.
[10] Pióro K.Subcubic algorithm for (unweighted) unrooted tree edit distance[C]//31st Annual European Symposium on Algorithms (ESA 2023).Dagstuhl,Germany:Schloss Dagstuhl-Leibniz-Zentrum für Informatik,2023:1-14.
[11] Zhang Kaizhong,Shasha D.Simple fast algorithms for the editing distance between trees and related problems[J].SIAM Journal on Computing,1989,18(6):1245-1262.
[12] Tai K C.The tree-to-tree correction problem[J].Journal of the ACM,1979,26(3):422-433.
[13] Liang Zhewei,Zhang Kaizhong.Efficient algorithms for local forest similarity thesis(M.Sc),school of graduate and postdoctoral studies[Z].2012:163-175.
[14] Peng Zeshan.Algorithms for local forest similarity[C]//Proceedings of the 16th International Conference on Algorithms and Computation.Sanya,Hainan,China,Heidelberg:Springer-Verlag,2005:704-713.
基本信息:
DOI:10.16191/j.cnki.hbkx.2026.05.005
中图分类号:TP18
引用信息:
[1]韩放,黄世中,冯春雨,等.基于带标号有序森林的局部森林相似度算法研究[J].河北省科学院学报,2026,43(05):36-42.DOI:10.16191/j.cnki.hbkx.2026.05.005.
2026-10-26
2026-10-26
