On optimal comparability editing with applications to molecular diagnostics

BMC Bioinformatics

Volumn 10, Issue SUPPL. 1, 2009, Pages

  Böcker, Sebastian ^a,b   Briesemeister, Sebastian ^c   Klau, Gunnar W ^d  

^a FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

^b Jena Centre for Bioinformatics   (Germany)

^c UNIVERSITY OF TÜBINGEN   (Germany)

^d CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL RESULTS; DISEASE CLASSIFICATION; EXACT ALGORITHMS; HEURISTIC APPROACH; INTEGER LINEAR PROGRAMMING; MOLECULAR DIAGNOSTICS; NEW APPROACHES; OPTIMAL SOLUTIONS;

ALGORITHMS; DIAGNOSIS; HEURISTIC METHODS; INTEGER PROGRAMMING; OPTIMAL SYSTEMS; BIOINFORMATICS;

COMPUTATIONAL EFFICIENCY;

ALGORITHM; ARTICLE; COMPARATIVE STUDY; COMPUTER PROGRAM; DIAGNOSTIC PROCEDURE; HUMAN; METHODOLOGY; STATISTICS; SYSTEM ANALYSIS;

ALGORITHMS; HUMANS; MOLECULAR DIAGNOSTIC TECHNIQUES; PROGRAMMING, LINEAR; SOFTWARE;

EID: 84857073547     PISSN: None     EISSN: 14712105     Source Type: Journal    
DOI: 10.1186/1471-2105-10-S1-S61     Document Type: Conference Paper

References (12)

1. Jacob J Jentsch M Kostka D Bentink S Spang R Detecting hierarchical structure in molecular characteristics of disease using transitive approximations of directed graphs Bioinformatics 2008, 24(7):995-1001. 18285370
2. Hummel M A biologic definition of Burkitt's lymphoma from transcriptional and genomic profiling N Engl J Med 2006, 354(23):2419-2430. 16760442
3. Delvaux S Horsten L On best transitive approximations to simple graphs Acta Inform 2004, 40(9):637-655.
4. Natanzon A Shamir R Sharan R Complexity Classification of Some Edge Modification Problems Proc. of Workshop on Graph-Theoretic Concepts in Computer Science (WG 1999) Lect. Notes Comput. Sc., Springer 1999:1665 65-77.
5. Křivánek M Morávek J NP-Hard Problems in Hierarchical-Tree Clustering Acta Inform 1986, 23(3):311-323.
6. Grötschel M Wakabayashi Y A cutting plane algorithm for a clustering problem Math Program 1989, 45:52-96.
7. Gramm J Guo J Hüffner F Niedermeier R Graph-modeled data clustering: Fixed-parameter algorithms for clique generation Theor Comput Syst 2005, 38(4):373-392.
8. Böcker S Briesemeister S Bui QBA Truß A A fixed-parameter approach for Weighted Cluster Editing Proc. of Asia-Pacific Bioinformatics Conference (APBC 2008) Series on Advances in Bioinformatics and Computational Biology, Imperial College Press 2008:5:211-220.
9. Böcker S Briesemeister S Klau GW Exact Algorithms for Cluster Editing: Evaluation and Experiments Proc. of Workshop on Experimental Algorithms (WEA 2008) Lect. Notes Comput. Sc., Springer 2008, 5038:289-302.
10. Niedermeier R Invitation to Fixed-Parameter Algorithms Oxford University Press 2006.
11. Müller R On the partial order polytope of a digraph Mathematical Programming 1996, 73:31-49.
12. Klau GW et al [web page] http://www.planet-lisa.net [Accessed 25 September 2008]