Abstract
An ordered labelled tree is a tree where the left-to-right order among siblings is significant. Ordered labelled forests are sequences of ordered labelled trees. Given two ordered labelled forests $$F$$ F and $$G$$ G , the local forest similarity is to find two sub-forests $$F^{\prime }$$ F ? and $$G^{\prime }$$ G ? of $$F$$ F and $$G$$ G respectively such that they are the most similar over all possible $$F^{\prime }$$ F ? and $$G^{\prime }$$ G ? . In this paper, we present efficient algorithms for the local forest similarity problem for two types of sub-forests: sibling subforests and closed subforests. Our algorithms can be used to locate the structurally similar regions in RNA secondary structures since RNA molecules' secondary structures could be represented as ordered labelled forests.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
