Classifying molecular sequences using a linkage graph with their pairwise similarities

DOI10.1016/S0304-3975(98)00091-7zbMath0912.68218MaRDI QIDQ1274603

K. Appert

Publication date: 12 January 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

graph coveringclique problemprotein sequence classification

Mathematics Subject Classification ID

Searching and sorting (68P10) Computing methodologies and applications (68U99)

Related Items (12)

Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs ⋮ Finding maximum subgraphs with relatively large vertex connectivity ⋮ A review on algorithms for maximum clique problems ⋮ Online summarization of dynamic graphs using subjective interestingness for sequential data ⋮ A Game-Theoretic Approach to Graph Clustering ⋮ Transfer distance between partitions ⋮ Graph clustering ⋮ Multivariate algorithmics for finding cohesive subnetworks ⋮ An efficient technique for superfamily classification of amino acid sequences: feature extraction, fuzzy clustering and prototype selection ⋮ Hardness and tractability of the \(\gamma\)\textsf{-Complete Subgraph} problem ⋮ Finding influential communities in networks with multiple influence types ⋮ Finding weighted \(k\)-truss communities in large networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• New approaches in classification and data analysis
• Printer graphics for clustering
• GENMARK: Parallel gene recognition for both DNA strands

This page was built for publication: Classifying molecular sequences using a linkage graph with their pairwise similarities