License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CPM.2016.10
URN: urn:nbn:de:0030-drops-60861
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2016/6086/
Go to the corresponding LIPIcs Volume Portal

Bartha, Dénes ; Burcsi, Peter ; Lipták, Zsuzsanna

Reconstruction of Trees from Jumbled and Weighted Subtrees

pdf-format:
LIPIcs-CPM-2016-10.pdf (0.6 MB)

Abstract

Let T be an edge-labeled graph, where the labels are from a finite alphabet Sigma. For a subtree U of T the Parikh vector of U is a vector of length |Sigma| which specifies the multiplicity of each label in U. We ask when T can be reconstructed from the multiset of Parikh vectors of all its subtrees, or all of its paths, or all of its maximal paths. We consider the analogous problems for weighted trees. We show how several well-known reconstruction problems on labeled strings, weighted strings and point sets on a line can be included in this framework. We present reconstruction algorithms and non-reconstructibility results, and extend the polynomial method, previously applied to jumbled strings [Acharya et al., SIAM J. on Discr. Math, 2015] and weighted strings [Bansal et al., CPM 2004], to deal with general trees and special tree classes.

BibTeX - Entry

@InProceedings{bartha_et_al:LIPIcs:2016:6086,
  author =	{D{\'e}nes Bartha and Peter Burcsi and Zsuzsanna Lipt{\'a}k},
  title =	{{Reconstruction of Trees from Jumbled and Weighted Subtrees}},
  booktitle =	{27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016)},
  pages =	{10:1--10:13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-012-5},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{54},
  editor =	{Roberto Grossi and Moshe Lewenstein},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2016/6086},
  URN =		{urn:nbn:de:0030-drops-60861},
  doi =		{10.4230/LIPIcs.CPM.2016.10},
  annote =	{Keywords: trees, paths, Parikh vectors, reconstruction problems, homometric sets, polynomial method, jumbled strings, weighted strings}
}

Keywords: trees, paths, Parikh vectors, reconstruction problems, homometric sets, polynomial method, jumbled strings, weighted strings
Collection: 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016)
Issue Date: 2016
Date of publication: 27.06.2016

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI