Two-Level Boolean Minimization
نویسندگان
چکیده
mation and Management (AAIM), Portland, OR, USA, Lecture Notes in Computer Science, vol. 4508, pp. 399–410. Springer (2007) 12. Jiang, M.: A PTAS for the weighted 2-interval pattern problem over the preceding-and-crossing model. In: Y.X. A.W.M. Dress, B. Zhu (eds.) Proc. 1st Annual International Conference on Combinatorial Optimization and Applications (COCOA), Xi’an, China, Lecture Notes in Computer Science, vol. 4616, pp. 378– 387. Springer (2007) 13. Joseph, D., Meidanis, J., Tiwari, P.: Determining DNA sequence similarity using maximum independent set algorithms for interval graphs. In: Proc. 3rd Scandinavian Workshop on Algorithm Theory (SWAT). Lecture Notes in Computer Science, pp. 326–337. Springer, Berlin (1992) 14. Lyngsø, R., Pedersen, C.: RNApseudoknot prediction in energybased models. J. Comput. Biol. 7, 409–427 (2000) 15. Micali, S., Vazirani, V.. An O sqrtjVjjEj algorithm for finding maximum matching in general graphs. In: Proc. 21st Annual Symposium on Foundation of Computer Science (FOCS), IEEE, 1980, pp. 17–27 16. Nussinov, R., Pieczenik, G., Griggs, J., Kleitman, D.: Algorithms for loop matchings. SIAM J. Appl. Math. 35, 68–82 (1978) 17. Ren, J., Rastegart, B., Condon, A., Hoos, H.: HotKnots: Heuristic prediction of rna secondary structure including pseudoknots. RNA 11, 1194–1504 (2005) 18. Rivas, E., Eddy, S.: A dynamic programming algorithm for RNA structure prediction including pseudoknots. J. Mol. Biol. 285, 2053–2068 (1999) 19. Ruan, J., Stormo, G., Zhang, W.: An iterated loop matching approach to the prediction of RNA secondary structures with pseudoknots. Bioinformatics 20, 58–66 (2004) 20. Vialette, S.: On the computational complexity of 2-interval pattern matching. Theor. Comput. Sci. 312, 223–249 (2004) 21. Zhao, J., Malmberg, R., Cai, L.: Rapid ab initio rna folding including pseudoknots via graph tree decomposition. In: Proc. Workshop on Algorithms in Bioinformatics. Lecture Notes in Computer Science, vol. 4175, pp. 262–273. Springer, Berlin (2006)
منابع مشابه
Single-level Partitioning Support in Boom-ii
We propose a modification of our Boolean minimizer BOOM-II enabling a single-level partitioning. The disadvantage of all the present logic synthesis systems is that the minimization and decomposition phases are strictly separated; the minimization process is independent on the subsequent decomposition. We propose a method where the two-level minimization is driven by some decomposition or other...
متن کاملThe Iterative Boolean Minimizer Fc-min
A novel two-level Boolean minimization method is presented here. In contrast to classical methods the cover of the on-set is computed first, whilst no implicants are known to this phase. The implicants are being derived from the source terms by their expansion directed by the cover. This allows us to generate group implicants directly, avoiding the time-consuming implicant expansions and reduct...
متن کاملA Graph Approach to Two-Level Logic Minimization
This paper presents a new approach to a classical two-level logic minimization problem. The approach is simple and efficient. It does not require sophisticated techniques or software packages such as BDDs, a class of Branch-and-Bound procedures, etc. A graph model is used to capture relations among closely related Boolean terms. Graph edges are dynamically assigned priority that allows us to ef...
متن کاملOn the Gap between the Complexity of SAT and Minimization for Certain Classes of Boolean Formulas
It is a wellknown fact that the satisfiability problem (SAT) for Boolean formulas in a conjunctive normal form (CNF) is NP complete, i.e. Σ1 complete. It is also known that the decision version of Boolean minimization for CNF inputs is Σ2 complete. On the other hand there are several subclasses of CNFs (e.g. Horn CNFs) for which SAT is known to be in P = Σ0 while the minimization problem is Σ1 ...
متن کاملTotal 6 Exact Hazard-free Logic Minimization. 4 Conditions for a Hazard-free Transition. Exact Two-level Minimization of Hazard-free Logic with Multiple-input Changes 3
This paper describes a new method for exact hazard-free logic minimization of Boolean functions. Given an incompletelyspecified Boolean function, the method produces a minimal sumof-products implementation which is hazard-free for a given set of multiple-input changes, if such a solution exists. The method is a constrained version of the Quine-McCluskey algorithm. It has been automated and appl...
متن کاملA power driven two-level logic optimizer
In this paper we present Boolean techniques for reducing the power consumption in two-level combinational circuits. The two-level logic optimizer performs the logic minimization for low power targeting static PLA, general logic gates and dynamic PLA implementations. We modify Espresso algorithm by adding our heuristics that bias the logic minimization toward lowering the power dissipation. In o...
متن کامل