Linear Computation of the Maximum Simultaneous Forward and Backward Bisimulation for Node-Labeled Trees
نویسندگان
چکیده
The F&B-index is used to speed up pattern matching in tree and graph data, and is based on the maximum F&B-bisimulation, which can be computed in loglinear time for graphs. It has been shown that the maximum F-bisimulation can be computed in linear time for DAGs. We build on this result, and introduce a linear algorithm for computing the maximum F&B-bisimulation for tree data. It first computes the maximum F-bisimulation, and then refines this to a maximal B-bisimulation. We prove that the result equals the maximum F&B-bisimulation.
منابع مشابه
Linear Computation of the Maximum Simultaneous Forward and Backward Bisimulation for Node-Labeled Trees (Extended Version)
Abstract. The F&B-index is used to speed up pattern matching in tree and graph data, and is based on the maximum F&B-bisimulation, which can be computed in loglinear time for graphs. It has been shown that the maximum F-bisimulation can be computed in linear time for DAGs. We build on this result, and introduce a linear algorithm for computing the maximum F&B-bisimulation for tree data. It firs...
متن کاملB-Mode Photoacoustic Imaging using Linear Array: Numerical Study for Forward-Backward Minimum Variance Beamformer Combined with Delay-Multiply-and-Sum
Photoacoustic imaging (PAI) is a promising medical imaging modality which provides the resolution of Ultrasound (US) and the contrast of Optical imaging modalities. One of the most important challenges in PAI is image formation, especially in the case that a linear-array US transducer is used for data acquisition. This is due to the fact that in the linear-array scenario, there is only 60 degre...
متن کاملتنظیم و کاربرد الگوریتم جنگل تصادفی در ارزیابی ژنومی
One of the most important issues in genomic selection is using a decent method for estimating marker effects and genomic evaluation. Recently, machine learning algorithms which are members of non-parametric and non-linear methods have been extended to genomic evaluation. One of these methods is Random Forest (RF) on which this research was focused. Important parameters in RF algorithm are the n...
متن کاملComputation of the greatest simulations and bisimulations between fuzzy automata
Recently, two types of simulations (forward and backward simulations) and four types of bisimulations (forward, backward, forward-backward, andbackward-forwardbisimulations) between fuzzyautomatahavebeen introduced. If there is at least one simulation/bisimulation of some of these types between the given fuzzy automata, it has been proved that there is the greatest simulation/bisimulation of th...
متن کاملILU and IUL factorizations obtained from forward and backward factored approximate inverse algorithms
In this paper, an efficient dropping criterion has been used to compute the IUL factorization obtained from Backward Factored APproximate INVerse (BFAPINV) and ILU factorization obtained from Forward Factored APproximate INVerse (FFAPINV) algorithms. We use different drop tolerance parameters to compute the preconditioners. To study the effect of such a dropping on the quality of the ILU ...
متن کامل