A clustering algorithm for interval graph test on noisy data

DOI10.1007/3-540-44867-5_16MaRDI QIDQ4426356zbMATH OpenFDO

Authors Wei-Fu Lu, Wenlian Hsu

Publication date 16 September 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2647/26470195.htm

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Protein sequences, DNA sequences (92D20)

Recommendations

• Interval graphs and maps of DNA
• scientific article; zbMATH DE number 2119749
• On probe interval graphs
• Realizing Interval Graphs with Size and Distance Constraints

Cited in

(2)

• Optimal construction of \(k\)-nearest-neighbor graphs for identifying noisy clusters
• A graph-theoretic barcode ordering model for linked-reads

This page was built for publication: A clustering algorithm for interval graph test on noisy data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4426356)