DNA sequences vectors and their compaction

AIP Conference Proceedings

Volumn 1117, Issue , 2009, Pages 29-39

  Logofátu, Doina ^a  

^a UNIVERSITY OF APPLIED SCIENCES   (Germany)

Author keywords

Backtracking; Compaction; Complexity; DNA Sequences; Greedy; Optimization

Indexed keywords

EID: 70450173540     PISSN: 0094243X     EISSN: 15517616     Source Type: Conference Proceeding    
DOI: 10.1063/1.3130629     Document Type: Conference Paper

References (19)

1. N. Alon, D. Moshkovitz and M. Safra, Algorithmic conslruction of sets for k-restrictions, ACM Transactions on Algorithms 2, 2, 153-177 (2006).
2. M. Cardei and J. Wu, Energy-efficient coverage problems in wireless ad-hoc sensor networks, Computer Communications 29, 4, 415-420 (2006).
3. T.H. Gormen, C.E. Leiserson, R.L. Rivest and C. Stein, Introduction to Algorithms, 2" Edition, MIT Press, 2001.
4. G. De Micheli, Synthesis and Optimization of Digital Circuits, McGraw-Hill, Inc., 1994.
5. N. Drechsler and R. Drechsler, "Exploiting don't cares during data sequencing using genetic algorithms" in ASP Design Automation Conf., 1999, pp.303-306.
6. A. El-Maleh and Y. Osais, Test vector decomposition based static compaction algorithms for combinatorial circuits, ACM Trans. Des. Autom. Electron. Syst. 8, pp.430-459, 2003.
7. U. Feige, A Threshold of Ln N for Approximating Set Cover, Journal of the ACM 45, 45, 634-652 (1998).
8. M.R. Garey, and D.S. Johnson, "Computers and Inlractability - A Guide to NP-Completeness", Freeman, San Francisco, 1979.
9. R. Guo, I. Pomeranz and S.M. Reddy, "On improving static test compaction for sequential circuits" in VLSI Design, Fourteenth International Conference, 2001, pp.111-116.
10. Y. Higami, S. Kajihara, I. Pomeranz, S. Kobayashi and Y Takamatsu, On Finding Don't Cares in Test Sequences for Sequential Circuits, lEICE Transactions on Information and Systems E89, 11, 2006.
11. D.S. Hochbaum and A. Pathria, Analysis of the greedy approach in problems of maximum k-coverage. Naval Research Logistics 45, 6, 615-627 (1998).
12. M.R. Karp, "Reductibility Among Combinatorial Problems" in Complexity of Computer Computations (Symposium Proceedings), Plenum Press, 1972.
13. D. Logofátu, Algorithmen undProhlemlosungen mit C++, Vieweg-Verlag, 2006.
14. D. Logofátu, Grundlegende Algorithmen mit Java, Vieweg-Verlag, 2008.
15. D. Logofátu and R. Drechsler, "Comparative Study by Solving the Test Compaction Problem", 38th Symposium on Multiple-Valued Logic, Dallas, 2008.
16. D. Logofátu, "Efficient Evolutionary Approach for the Test Compaction Problem", 9 International Conference on Development and Application Systems, Suceava, 2008.
17. D. Logofátu and R. Drechsler, Efficient Evolutionary Approaches for the Data Ordering Problem with Inversion, 3rd European Workshop on Hardware Optimisation Techniques (EvoHOT), Budapest, LNCS 3907, 320-331 (2006).
18. C. Lund and M. Yannakakis, On the hardness of approximating minimization problems. Journal of the ACM 41,5,960-981 (1994).
19. A.T. Murray, K.K. Kim, J.W. Davis, R. Machiraju and R. Parent, Coverage optimization to support security monitoring. Computers, Environment and Urban Systems 31, 2, 133-147 (2007).