Pages that link to "Item:Q294684"

The following pages link to On an algorithm of Zemlyachenko for subtree isomorphism (Q294684):

Displaying 10 items.

• A bisection algorithm for grammar-based compression of ordered trees (Q407558) (← links)
• Inferring a graph from path frequency (Q427879) (← links)
• The saga of minimum spanning trees (Q458468) (← links)
• Efficient enumeration of stereoisomers of tree structured molecules using dynamic programming (Q535320) (← links)
• Exact algorithms for computing the tree edit distance between unordered trees (Q620949) (← links)
• Finding maximal leaf-agreement isomorphic descendent subtrees from phylogenetic trees with different species (Q868961) (← links)
• An efficient strategy for generating all descendant subtree patterns from phylogenetic trees with its implementation (Q990618) (← links)
• Encoding trees by linear recurrence sequences (Q1699391) (← links)
• Cleaning interval graphs (Q1939654) (← links)
• FAST ALGORITHMS FOR COMPARISON OF SIMILAR UNORDERED TREES (Q5483380) (← links)