Inferring a tree from walks

DOI10.1016/0304-3975(95)00156-5zbMATH Open0872.68137OpenAlexW2062960999MaRDI QIDQ1351963FDOQ1351963

Authors: Osamu Maruyama, Satoru Miyano 

Publication date: 27 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(95)00156-5

Recommendations

• Inferring a tree from walks
• Walks and paths in trees
• Walks in phylogenetic treespace
• Publication:4887809
• Reconstructing trees from traces
• Counting trees with random walks
• scientific article; zbMATH DE number 3949430
• Random walks and trees
• Tree-Walking Automata

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Title not available (Why is that?)
• Optimization, approximation, and complexity classes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Complexity of automaton identification from given data
• On the complexity of minimum inference of regular sets
• On finding minimal length superstrings
• Linear approximation of shortest superstrings
• Bounded degree graph inference from walks
• The minimum consistent DFA problem cannot be approximated within any polynomial
• A note on shortest superstrings with flipping
• Graph inference from a walk for trees of bounded degree 3 is NP-complete

Cited In (7)

• Graph inference from a walk for trees of bounded degree 3 is NP-complete
• Inferring a graph from path frequency
• Learning Tree Languages
• Title not available (Why is that?)
• Combinatorial Pattern Matching
• Range and speed of rotor walks on trees
• Inferring a tree from walks

This page was built for publication: Inferring a tree from walks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1351963)