Blažević, Mislav; Canzar, Stefan; Elbassioni, Khaled; Matijević, Domagoj Anti Tai mapping for unordered labeled trees. (English) Zbl 07817058 Inf. Process. Lett. 185, Article ID 106454, 6 p. (2024). MSC: 68Qxx PDFBibTeX XMLCite \textit{M. Blažević} et al., Inf. Process. Lett. 185, Article ID 106454, 6 p. (2024; Zbl 07817058) Full Text: DOI arXiv
Šestáková, Eliška; Guth, Ondřej; Janoušek, Jan Inexact tree pattern matching with 1-degree edit distance using finite automata. (English) Zbl 1506.68085 Discrete Appl. Math. 330, 78-97 (2023). MSC: 68R10 68Q25 68Q45 PDFBibTeX XMLCite \textit{E. Šestáková} et al., Discrete Appl. Math. 330, 78--97 (2023; Zbl 1506.68085) Full Text: DOI
Charalampopoulos, Panagiotis; Gawrychowski, Paweł; Mozes, Shay; Weimann, Oren On the hardness of computing the edit distance of shallow trees. (English) Zbl 1525.68037 Arroyuelo, Diego (ed.) et al., String processing and information retrieval. 29th international symposium, SPIRE 2022, Concepción, Chile, November 8–10, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13617, 290-302 (2022). MSC: 68P05 68Q17 68Q25 68W32 PDFBibTeX XMLCite \textit{P. Charalampopoulos} et al., Lect. Notes Comput. Sci. 13617, 290--302 (2022; Zbl 1525.68037) Full Text: DOI
Akutsu, Tatsuya; Jansson, Jesper; Li, Ruiming; Takasu, Atsuhiro; Tamura, Takeyuki New and improved algorithms for unordered tree inclusion. (English) Zbl 1517.68267 Theor. Comput. Sci. 883, 83-98 (2021). MSC: 68R10 05C05 05C85 68Q27 68W40 PDFBibTeX XMLCite \textit{T. Akutsu} et al., Theor. Comput. Sci. 883, 83--98 (2021; Zbl 1517.68267) Full Text: DOI arXiv Link
You, Jie; Shi, Feng; Wang, Jianxin; Feng, Qilong Fixed-parameter tractability for minimum tree cut/paste distance and minimum common integer partition. (English) Zbl 1436.68149 Theor. Comput. Sci. 806, 256-270 (2020). MSC: 68Q27 05A17 05C05 68W40 92-08 PDFBibTeX XMLCite \textit{J. You} et al., Theor. Comput. Sci. 806, 256--270 (2020; Zbl 1436.68149) Full Text: DOI
Bernardini, Giulia; Bonizzoni, Paola; Della Vedova, Gianluca; Patterson, Murray A rearrangement distance for fully-labelled trees. (English) Zbl 07559196 Pisanti, Nadia (ed.) et al., 30th annual symposium on combinatorial pattern matching, CPM 2019, Pisa, Italy, June 18–20, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 128, Article 28, 15 p. (2019). MSC: 68W32 PDFBibTeX XMLCite \textit{G. Bernardini} et al., LIPIcs -- Leibniz Int. Proc. Inform. 128, Article 28, 15 p. (2019; Zbl 07559196) Full Text: DOI arXiv
Rachkovskij, D. A. Fast similarity search for graphs by edit distance. (English. Russian original) Zbl 1433.68106 Cybern. Syst. Anal. 55, No. 6, 1039-1051 (2019); translation from Kibern. Sist. Anal. 2019, No. 6, 178-194 (2019). MSC: 68P05 68P10 68P15 68R10 PDFBibTeX XMLCite \textit{D. A. Rachkovskij}, Cybern. Syst. Anal. 55, No. 6, 1039--1051 (2019; Zbl 1433.68106); translation from Kibern. Sist. Anal. 2019, No. 6, 178--194 (2019) Full Text: DOI
Han, Yo-Sub; Ko, Sang-Ki Alignment distance of regular tree languages. (English) Zbl 1430.68146 Theor. Comput. Sci. 787, 127-137 (2019). MSC: 68Q45 68P05 68W40 PDFBibTeX XMLCite \textit{Y.-S. Han} and \textit{S.-K. Ko}, Theor. Comput. Sci. 787, 127--137 (2019; Zbl 1430.68146) Full Text: DOI
Akutsu, Tatsuya; Jansson, Jesper; Li, Ruiming; Takasu, Atsuhiro; Tamura, Takeyuki New and improved algorithms for unordered tree inclusion. (English) Zbl 1517.68268 Hsu, Wen-Lian (ed.) et al., 29th international symposium on algorithms and computation, ISAAC 2018, December 16–19, 2018, Jiaoxi, Yilan, Taiwan. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 123, Article 27, 12 p. (2018). MSC: 68R10 05C05 05C85 68Q27 68W40 PDFBibTeX XMLCite \textit{T. Akutsu} et al., LIPIcs -- Leibniz Int. Proc. Inform. 123, Article 27, 12 p. (2018; Zbl 1517.68268) Full Text: DOI
Dudek, Bartlomiej; Gawrychowski, Pawel Edit distance between unrooted trees in cubic time. (English) Zbl 1499.68380 Chatzigiannakis, Ioannis (ed.) et al., 45th international colloquium on automata, languages, and programming. ICALP 2018, Prague, Czech Republic, July 9–13, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 107, Article 45, 14 p. (2018). MSC: 68W05 68P05 68W40 PDFBibTeX XMLCite \textit{B. Dudek} and \textit{P. Gawrychowski}, LIPIcs -- Leibniz Int. Proc. Inform. 107, Article 45, 14 p. (2018; Zbl 1499.68380) Full Text: DOI arXiv
Shin, Kilho; Ishikawa, Taichi Linear-time algorithms for the subpath kernel. (English) Zbl 1497.68555 Navarro, Gonzalo (ed.) et al., 29th annual symposium on combinatorial pattern matching, CPM 2018, July 2–4, 2018, Qingdao, China. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 105, Article 22, 13 p. (2018). MSC: 68W05 68P05 68T05 PDFBibTeX XMLCite \textit{K. Shin} and \textit{T. Ishikawa}, LIPIcs -- Leibniz Int. Proc. Inform. 105, Article 22, 13 p. (2018; Zbl 1497.68555) Full Text: DOI
Berkemer, Sarah J.; Höner zu Siederdissen, Christian; Stadler, Peter F. Algebraic dynamic programming on trees. (English) Zbl 1461.68094 Algorithms (Basel) 10, No. 4, Paper No. 135, 31 p. (2017). MSC: 68Q42 68N18 90C39 PDFBibTeX XMLCite \textit{S. J. Berkemer} et al., Algorithms (Basel) 10, No. 4, Paper No. 135, 31 p. (2017; Zbl 1461.68094) Full Text: DOI
Han, Yo-Sub; Ko, Sang-Ki Alignment distance of regular tree languages. (English) Zbl 1429.68115 Carayol, Arnaud (ed.) et al., Implementation and application of automata. 22nd international conference, CIAA 2017, Marne-la-Vallée, France, June 27–30, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10329, 126-137 (2017). MSC: 68Q45 PDFBibTeX XMLCite \textit{Y.-S. Han} and \textit{S.-K. Ko}, Lect. Notes Comput. Sci. 10329, 126--137 (2017; Zbl 1429.68115) Full Text: DOI
Yoshino, Takuya; Hirata, Kouichi Tai mapping hierarchy for rooted labeled trees through common subforest. (English) Zbl 1368.68193 Theory Comput. Syst. 60, No. 4, 759-783 (2017). MSC: 68P05 05C05 PDFBibTeX XMLCite \textit{T. Yoshino} and \textit{K. Hirata}, Theory Comput. Syst. 60, No. 4, 759--783 (2017; Zbl 1368.68193) Full Text: DOI
Emmert-Streib, Frank; Dehmer, Matthias; Shi, Yongtang Fifty years of graph matching, network alignment and network comparison. (English) Zbl 1398.68393 Inf. Sci. 346-347, 180-197 (2016). MSC: 68R10 05-03 68-03 92-03 05C60 05C80 05C82 05C85 05C90 68T10 92C42 92E10 PDFBibTeX XMLCite \textit{F. Emmert-Streib} et al., Inf. Sci. 346--347, 180--197 (2016; Zbl 1398.68393) Full Text: DOI
Nakamura, Atsuyoshi; Takigawa, Ichigaku; Tosaka, Hisashi; Kudo, Mineichi; Mamitsuka, Hiroshi Mining approximate patterns with frequent locally optimal occurrences. (English) Zbl 1329.05017 Discrete Appl. Math. 200, 123-152 (2016). MSC: 05A15 68T10 PDFBibTeX XMLCite \textit{A. Nakamura} et al., Discrete Appl. Math. 200, 123--152 (2016; Zbl 1329.05017) Full Text: DOI
Bourhis, Pierre; Puppis, Gabriele; Riveros, Cristian Which XML schemas are streaming bounded repairable? (English) Zbl 1352.68078 Theory Comput. Syst. 57, No. 4, 1250-1321 (2015). MSC: 68P15 68Q45 PDFBibTeX XMLCite \textit{P. Bourhis} et al., Theory Comput. Syst. 57, No. 4, 1250--1321 (2015; Zbl 1352.68078) Full Text: DOI
Shin, Kilho A theory of subtree matching and tree kernels based on the edit distance concept. (English) Zbl 1347.68114 Ann. Math. Artif. Intell. 75, No. 3-4, 419-460 (2015). MSC: 68P15 68P05 PDFBibTeX XMLCite \textit{K. Shin}, Ann. Math. Artif. Intell. 75, No. 3--4, 419--460 (2015; Zbl 1347.68114) Full Text: DOI
Akutsu, Tatsuya; Tamura, Takeyuki; Melkman, Avraham A.; Takasu, Atsuhiro On the complexity of finding a largest common subtree of bounded degree. (English) Zbl 1327.68122 Theor. Comput. Sci. 590, 2-16 (2015). MSC: 68Q25 05C05 05C85 68P05 90C39 PDFBibTeX XMLCite \textit{T. Akutsu} et al., Theor. Comput. Sci. 590, 2--16 (2015; Zbl 1327.68122) Full Text: DOI
Shin, Kilho Tree edit distance and maximum agreement subtree. (English) Zbl 1366.68101 Inf. Process. Lett. 115, No. 1, 69-73 (2015). MSC: 68Q25 05C05 05C12 05C85 PDFBibTeX XMLCite \textit{K. Shin}, Inf. Process. Lett. 115, No. 1, 69--73 (2015; Zbl 1366.68101) Full Text: DOI
Li, Fei; Wang, Hongzhi; Hao, Liang; Li, Jianzhong; Gao, Hong Approximate joins for XML at label level. (English) Zbl 1355.68074 Inf. Sci. 282, 237-249 (2014). MSC: 68P15 PDFBibTeX XMLCite \textit{F. Li} et al., Inf. Sci. 282, 237--249 (2014; Zbl 1355.68074) Full Text: DOI
Kumar, P. Pavan; Agarwal, Arun; Bhagvati, Chakravarthy A string matching based algorithm for performance evaluation of mathematical expression recognition. (English) Zbl 1322.68167 Sādhanā 39, No. 1, 63-79 (2014). MSC: 68T10 68W32 PDFBibTeX XMLCite \textit{P. P. Kumar} et al., Sādhanā 39, No. 1, 63--79 (2014; Zbl 1322.68167) Full Text: DOI Link
Yamamoto, Yoshiyuki; Hirata, Kouichi; Kuboyama, Tetsuji Tractable and intractable variations of unordered tree edit distance. (English) Zbl 1303.05203 Int. J. Found. Comput. Sci. 25, No. 3, 307-329 (2014). MSC: 05C85 05C12 05C05 05C07 68Q17 PDFBibTeX XMLCite \textit{Y. Yamamoto} et al., Int. J. Found. Comput. Sci. 25, No. 3, 307--329 (2014; Zbl 1303.05203) Full Text: DOI
Akutsu, Tatsuya; Tamura, Takeyuki; Fukagawa, Daiji; Takasu, Atsuhiro Efficient exponential-time algorithms for edit distance between unordered trees. (English) Zbl 1284.05259 J. Discrete Algorithms 25, 79-93 (2014). MSC: 05C85 05C05 68Q17 68W25 PDFBibTeX XMLCite \textit{T. Akutsu} et al., J. Discrete Algorithms 25, 79--93 (2014; Zbl 1284.05259) Full Text: DOI
Tahraoui, Mohammed Amin; Pinel-Sauvagnat, Karen; Laitang, Cyril; Boughanem, Mohand; Kheddouci, Hamamache; Ning, Lei A survey on tree matching and XML retrieval. (English) Zbl 1295.68109 Comput. Sci. Rev. 8, 1-23 (2013). Reviewer: Jaroslav Pokorný (Praha) MSC: 68P20 68P05 68P15 68R10 PDFBibTeX XMLCite \textit{M. A. Tahraoui} et al., Comput. Sci. Rev. 8, 1--23 (2013; Zbl 1295.68109) Full Text: DOI HAL
Di Fabio, B.; Landi, C. Reeb graphs of curves are stable under function perturbations. (English) Zbl 1247.05064 Math. Methods Appl. Sci. 35, No. 12, 1456-1471 (2012). MSC: 05C10 68T10 54C30 PDFBibTeX XMLCite \textit{B. Di Fabio} and \textit{C. Landi}, Math. Methods Appl. Sci. 35, No. 12, 1456--1471 (2012; Zbl 1247.05064) Full Text: DOI Link
Allali, Julien; Chauve, Cedric; Ferraro, Pascal; Gaillard, Anne-Laure Efficient chaining of seeds in ordered trees. (English) Zbl 1316.68209 J. Discrete Algorithms 14, 107-118 (2012). MSC: 68W40 05C90 68W32 92D10 PDFBibTeX XMLCite \textit{J. Allali} et al., J. Discrete Algorithms 14, 107--118 (2012; Zbl 1316.68209) Full Text: DOI
Li, Yujian; Chenguang, Zhang A metric normalization of tree edit distance. (English) Zbl 1267.68227 Front. Comput. Sci. China 5, No. 1, 119-125 (2011). MSC: 68T30 68W32 68T10 PDFBibTeX XMLCite \textit{Y. Li} and \textit{Z. Chenguang}, Front. Comput. Sci. China 5, No. 1, 119--125 (2011; Zbl 1267.68227) Full Text: DOI
Hirata, Kouichi; Yamamoto, Yoshiyuki; Kuboyama, Tetsuji Improved MAX SNP-hard results for finding an edit distance between unordered trees. (English) Zbl 1339.68105 Giancarlo, Raffaele (ed.) et al., Combinatorial pattern matching. 22nd annual symposium, CPM 2011, Palermo, Italy, June 27–29, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21457-8/pbk). Lecture Notes in Computer Science 6661, 402-415 (2011). MSC: 68Q17 05C05 68P05 68R10 PDFBibTeX XMLCite \textit{K. Hirata} et al., Lect. Notes Comput. Sci. 6661, 402--415 (2011; Zbl 1339.68105) Full Text: DOI
Schirmer, Stefanie; Giegerich, Robert Forest alignment with affine gaps and anchors. (English) Zbl 1339.68212 Giancarlo, Raffaele (ed.) et al., Combinatorial pattern matching. 22nd annual symposium, CPM 2011, Palermo, Italy, June 27–29, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21457-8/pbk). Lecture Notes in Computer Science 6661, 104-117 (2011). MSC: 68R10 68Q25 92D20 PDFBibTeX XMLCite \textit{S. Schirmer} and \textit{R. Giegerich}, Lect. Notes Comput. Sci. 6661, 104--117 (2011; Zbl 1339.68212) Full Text: DOI
Jansson, Jesper; Peng, Zeshan Algorithms for finding a most similar subforest. (English) Zbl 1217.68242 Theory Comput. Syst. 48, No. 4, 865-887 (2011). MSC: 68W05 92D15 PDFBibTeX XMLCite \textit{J. Jansson} and \textit{Z. Peng}, Theory Comput. Syst. 48, No. 4, 865--887 (2011; Zbl 1217.68242) Full Text: DOI
Akutsu, Tatsuya; Fukagawa, Daiji; Takasu, Atsuhiro; Tamura, Takeyuki Exact algorithms for computing the tree edit distance between unordered trees. (English) Zbl 1206.68224 Theor. Comput. Sci. 412, No. 4-5, 352-364 (2011). MSC: 68R10 68T10 90C39 PDFBibTeX XMLCite \textit{T. Akutsu} et al., Theor. Comput. Sci. 412, No. 4--5, 352--364 (2011; Zbl 1206.68224) Full Text: DOI Link
Brucker, Florian; Benites, Fernando; Sapozhnikova, Elena Multi-label classification and extracting predicted class hierarchies. (English) Zbl 1209.68442 Pattern Recognition 44, No. 3, 724-738 (2011). MSC: 68T10 PDFBibTeX XMLCite \textit{F. Brucker} et al., Pattern Recognition 44, No. 3, 724--738 (2011; Zbl 1209.68442) Full Text: DOI
Wu, Chan-Shuo; Huang, Guan-Shieng A metric for rooted trees with unlabeled vertices based on nested parentheses. (English) Zbl 1238.68112 Theor. Comput. Sci. 411, No. 44-46, 3923-3931 (2010). MSC: 68R10 68W25 68Q17 05C05 PDFBibTeX XMLCite \textit{C.-S. Wu} and \textit{G.-S. Huang}, Theor. Comput. Sci. 411, No. 44--46, 3923--3931 (2010; Zbl 1238.68112) Full Text: DOI
Raynal, Benjamin; Couprie, Michel; Biri, Venceslas Homeomorphic alignment of weighted trees. (English) Zbl 1207.68311 Pattern Recognition 43, No. 8, 2937-2949 (2010). MSC: 68T10 68T45 PDFBibTeX XMLCite \textit{B. Raynal} et al., Pattern Recognition 43, No. 8, 2937--2949 (2010; Zbl 1207.68311) Full Text: DOI
Akutsu, Tatsuya; Fukagawa, Daiji; Takasu, Atsuhiro Approximating tree edit distance through string edit distance. (English) Zbl 1184.68628 Algorithmica 57, No. 2, 325-348 (2010). MSC: 68W25 PDFBibTeX XMLCite \textit{T. Akutsu} et al., Algorithmica 57, No. 2, 325--348 (2010; Zbl 1184.68628) Full Text: DOI
Tekli, Joe; Chbeir, Richard; Yetongnon, Kokou An overview on XML similarity: background, current trends and future directions. (English) Zbl 1300.68024 Comput. Sci. Rev. 3, No. 3, 151-173 (2009). MSC: 68P20 68P05 68P15 68T10 68T05 68-02 PDFBibTeX XMLCite \textit{J. Tekli} et al., Comput. Sci. Rev. 3, No. 3, 151--173 (2009; Zbl 1300.68024) Full Text: DOI
Akutsu, Tatsuya; Fukagawa, Daiji; Takasu, Atsuhiro Improved approximation of the largest common subtree of two unordered trees of bounded height. (English) Zbl 1191.68858 Inf. Process. Lett. 109, No. 2, 165-170 (2009). MSC: 68W25 PDFBibTeX XMLCite \textit{T. Akutsu} et al., Inf. Process. Lett. 109, No. 2, 165--170 (2009; Zbl 1191.68858) Full Text: DOI
Mozes, Shay; Tsur, Dekel; Weimann, Oren; Ziv-Ukelson, Michal Fast algorithms for computing tree LCS. (English) Zbl 1187.68684 Theor. Comput. Sci. 410, No. 43, 4303-4314 (2009). MSC: 68W05 90C39 68R10 PDFBibTeX XMLCite \textit{S. Mozes} et al., Theor. Comput. Sci. 410, No. 43, 4303--4314 (2009; Zbl 1187.68684) Full Text: DOI
Raynal, Benjamin; Couprie, Michel; Biri, Venceslas Homeomorphic alignment of edge-weighted trees. (English) Zbl 1248.68511 Torsello, Andrea (ed.) et al., Graph-based representations in pattern recognition. 7th IAPR-TC-15 international workshop, GbRPR 2009, Venice, Italy, May 26–28, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-02123-7/pbk). Lecture Notes in Computer Science 5534, 134-143 (2009). MSC: 68T45 05C05 68R10 68T10 PDFBibTeX XMLCite \textit{B. Raynal} et al., Lect. Notes Comput. Sci. 5534, 134--143 (2009; Zbl 1248.68511) Full Text: DOI HAL
Tsur, Dekel Faster algorithms for guided tree edit distance. (English) Zbl 1191.68213 Inf. Process. Lett. 108, No. 4, 251-254 (2008). MSC: 68P05 PDFBibTeX XMLCite \textit{D. Tsur}, Inf. Process. Lett. 108, No. 4, 251--254 (2008; Zbl 1191.68213) Full Text: DOI
Wang, Lusheng; Zhang, Kaizhong Space efficient algorithms for ordered tree comparison. (English) Zbl 1203.68129 Algorithmica 51, No. 3, 283-297 (2008). MSC: 68R10 68W05 PDFBibTeX XMLCite \textit{L. Wang} and \textit{K. Zhang}, Algorithmica 51, No. 3, 283--297 (2008; Zbl 1203.68129) Full Text: DOI
Mozes, Shay; Tsur, Dekel; Weimann, Oren; Ziv-Ukelson, Michal Fast algorithms for computing tree LCS. (English) Zbl 1143.68632 Ferragina, Paolo (ed.) et al., Combinatorial pattern matching. 19th annual symposium, CPM 2008, Pisa, Italy, June 18–20, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-69066-5/pbk). Lecture Notes in Computer Science 5029, 230-243 (2008). MSC: 68W05 68P05 PDFBibTeX XMLCite \textit{S. Mozes} et al., Lect. Notes Comput. Sci. 5029, 230--243 (2008; Zbl 1143.68632) Full Text: DOI
Touzet, Hélène Comparing similar ordered trees in linear-time. (English) Zbl 1156.68042 J. Discrete Algorithms 5, No. 4, 696-705 (2007). MSC: 68R10 05C05 05C12 05C85 92D20 PDFBibTeX XMLCite \textit{H. Touzet}, J. Discrete Algorithms 5, No. 4, 696--705 (2007; Zbl 1156.68042) Full Text: DOI
Ouangraoua, Aïda; Ferraro, Pascal; Tichit, Laurent; Dulucq, Serge Local similarity between quotiented ordered trees. (English) Zbl 1140.05301 J. Discrete Algorithms 5, No. 1, 23-35 (2007). MSC: 05C05 90C39 68W05 68W40 92D20 PDFBibTeX XMLCite \textit{A. Ouangraoua} et al., J. Discrete Algorithms 5, No. 1, 23--35 (2007; Zbl 1140.05301) Full Text: DOI
Magniez, Frédéric; de Rougemont, Michel Property testing of regular tree languages. (English) Zbl 1131.68055 Algorithmica 49, No. 2, 127-146 (2007). MSC: 68Q45 PDFBibTeX XMLCite \textit{F. Magniez} and \textit{M. de Rougemont}, Algorithmica 49, No. 2, 127--146 (2007; Zbl 1131.68055) Full Text: DOI
Akutsu, Tatsuya A relation between edit distance for ordered trees and edit distance for Euler strings. (English) Zbl 1185.68829 Inf. Process. Lett. 100, No. 3, 105-109 (2006). MSC: 68W05 68R10 PDFBibTeX XMLCite \textit{T. Akutsu}, Inf. Process. Lett. 100, No. 3, 105--109 (2006; Zbl 1185.68829) Full Text: DOI
Fukagawa, Daiji; Akutsu, Tatsuya Fast algorithms for comparison of similar unordered trees. (English) Zbl 1098.68139 Int. J. Found. Comput. Sci. 17, No. 3, 703-729 (2006). MSC: 68W05 PDFBibTeX XMLCite \textit{D. Fukagawa} and \textit{T. Akutsu}, Int. J. Found. Comput. Sci. 17, No. 3, 703--729 (2006; Zbl 1098.68139) Full Text: DOI
Dulucq, Serge; Touzet, Hélène Decomposition algorithms for the tree edit distance problem. (English) Zbl 1129.68099 J. Discrete Algorithms 3, No. 2-4, 448-471 (2005). MSC: 68W40 92D20 05C05 05C12 PDFBibTeX XMLCite \textit{S. Dulucq} and \textit{H. Touzet}, J. Discrete Algorithms 3, No. 2--4, 448--471 (2005; Zbl 1129.68099) Full Text: DOI
Bille, Philip A survey on tree edit distance and related problems. (English) Zbl 1078.68152 Theor. Comput. Sci. 337, No. 1-3, 217-239 (2005). Reviewer: Jozef Vyskoč (Bratislava) MSC: 68W05 68W40 92D20 PDFBibTeX XMLCite \textit{P. Bille}, Theor. Comput. Sci. 337, No. 1--3, 217--239 (2005; Zbl 1078.68152) Full Text: DOI
Dulucq, Serge; Tichit, Laurent RNA secondary structure comparison: Exact analysis of the Zhang-Shasha tree edit algorithm. (English) Zbl 1060.68027 Theor. Comput. Sci. 306, No. 1-3, 471-484 (2003). MSC: 68P10 PDFBibTeX XMLCite \textit{S. Dulucq} and \textit{L. Tichit}, Theor. Comput. Sci. 306, No. 1--3, 471--484 (2003; Zbl 1060.68027) Full Text: DOI
Ma, Bin; Wang, Lusheng; Zhang, Kaizhong Computing similarity between RNA structures. (English) Zbl 1002.68058 Theor. Comput. Sci. 276, No. 1-2, 111-132 (2002). MSC: 68Q10 68Q17 92-08 92C40 92D20 PDFBibTeX XMLCite \textit{B. Ma} et al., Theor. Comput. Sci. 276, No. 1--2, 111--132 (2002; Zbl 1002.68058) Full Text: DOI
Wang, Jason T. L.; Zhang, Kaizhong Finding similar consensus between trees: An algorithm and a distance hierarchy. (English) Zbl 0972.68142 Pattern Recognition 34, No. 1, 127-137 (2001). MSC: 68T10 PDFBibTeX XMLCite \textit{J. T. L. Wang} and \textit{K. Zhang}, Pattern Recognition 34, No. 1, 127--137 (2001; Zbl 0972.68142) Full Text: DOI
Wang, Jason T. L.; Zhang, Kaizhong Identifying consensus of trees through alignment. (English) Zbl 0969.68595 Inf. Sci. 126, No. 1-4, 165-189 (2000). MSC: 68U99 68P05 PDFBibTeX XMLCite \textit{J. T. L. Wang} and \textit{K. Zhang}, Inf. Sci. 126, No. 1--4, 165--189 (2000; Zbl 0969.68595) Full Text: DOI
Wang, Jason T. L.; Zhang, Kaizhong; Chang, Chia-Yo Identifying approximately common substructures in trees based on a restricted edit distance. (English) Zbl 0949.68174 Inf. Sci. 121, No. 3-4, 367-386 (1999). MSC: 68W05 PDFBibTeX XMLCite \textit{J. T. L. Wang} et al., Inf. Sci. 121, No. 3--4, 367--386 (1999; Zbl 0949.68174) Full Text: DOI
Zhang, Kaizhong A constrained edit distance between unordered labeled trees. (English) Zbl 0839.68035 Algorithmica 15, No. 3, 205-222 (1996). MSC: 68W10 68R10 PDFBibTeX XMLCite \textit{K. Zhang}, Algorithmica 15, No. 3, 205--222 (1996; Zbl 0839.68035) Full Text: DOI
Jiang, Tao; Wang, Lusheng; Zhang, Kaizhong Alignment of trees – an alternative to tree edit. (English) Zbl 0873.68150 Theor. Comput. Sci. 143, No. 1, 137-148 (1995). MSC: 68R10 68Q25 PDFBibTeX XMLCite \textit{T. Jiang} et al., Theor. Comput. Sci. 143, No. 1, 137--148 (1995; Zbl 0873.68150) Full Text: DOI
Wang, Jason T. L.; Zhang, Kaizhong; Chirn, Gung-Wei Algorithms for approximate graph matching. (English) Zbl 0878.68096 Inf. Sci. 82, No. 1-2, 45-74 (1995). MSC: 68R10 PDFBibTeX XMLCite \textit{J. T. L. Wang} et al., Inf. Sci. 82, No. 1--2, 45--74 (1995; Zbl 0878.68096) Full Text: DOI
Oommen, B. John; Lee, William Constrained tree editing. (English) Zbl 0821.68100 Inf. Sci. 77, No. 3-4, 253-273 (1994). MSC: 68R10 68P05 PDFBibTeX XMLCite \textit{B. J. Oommen} and \textit{W. Lee}, Inf. Sci. 77, No. 3--4, 253--273 (1994; Zbl 0821.68100) Full Text: DOI
Xu, Meirui; Liu, Xiaolin A VLSI algorithm for calculating the tree to tree distance. (English) Zbl 0813.68119 J. Comput. Sci. Technol. 8, No. 1, 68-76 (1993). MSC: 68W35 68R10 68T10 PDFBibTeX XMLCite \textit{M. Xu} and \textit{X. Liu}, J. Comput. Sci. Technol. 8, No. 1, 68--76 (1993; Zbl 0813.68119) Full Text: DOI
Zhang, Kaizhong; Statman, Rick; Shasha, Dennis On the editing distance between unordered labeled trees. (English) Zbl 0780.68070 Inf. Process. Lett. 42, No. 3, 133-139 (1992). MSC: 68Q25 68P05 PDFBibTeX XMLCite \textit{K. Zhang} et al., Inf. Process. Lett. 42, No. 3, 133--139 (1992; Zbl 0780.68070) Full Text: DOI
Wilhelm, Reinhard A modified tree-to-tree correction problem. (English) Zbl 0461.68070 Inf. Process. Lett. 12, 127-132 (1981). MSC: 68R99 68N99 68Q25 PDFBibTeX XMLCite \textit{R. Wilhelm}, Inf. Process. Lett. 12, 127--132 (1981; Zbl 0461.68070) Full Text: DOI