×

Found 62 Documents (Results 1–62)

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).
PDFBibTeX XMLCite
Full Text: DOI

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
Full Text: DOI arXiv

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).
PDFBibTeX XMLCite
Full Text: DOI

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
Full Text: DOI arXiv

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
Full Text: DOI

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).
PDFBibTeX XMLCite
Full Text: DOI

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
Full Text: DOI

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).
PDFBibTeX XMLCite
Full Text: DOI HAL

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
Full Text: DOI

Filter Results by …

Document Type

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software