Classifying molecular sequences using a linkage graph with their pairwise similarities

DOI10.1016/S0304-3975(98)00091-7MaRDI QIDQ1274603zbMATH OpenFDO

Authors K. Appert, A. Hashimoto, H. Matsuda, T. Ishihara

Publication date 12 January 1999

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

Full work available at URL https://doi.org/10.1016/S0304-3975(98)00091-7

zbMATH Keywords

clique problemgraph coveringprotein sequence classification

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1222689
• Descriptors of 2D-dynamic graphs as a classification tool of DNA sequences
• Genetic sequence classification and its application to cross-species homology detection
• Similarity analysis of protein sequences based on a new graphical representation method
• Genome classification using overlap graph centralities
• Protein classification by matching and clustering surface graphs
• Determining DNA sequence similarity using maximum independent set algorithms for interval graphs

Cites work

• GENMARK: Parallel gene recognition for both DNA strands
• scientific article; zbMATH DE number 3126094 (Why is no real title available?)
• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 3571502 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 699389 (Why is no real title available?)
• New approaches in classification and data analysis
• Printer graphics for clustering

Cited in

(14)

• 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\)-complete subgraph problem
• Finding influential communities in networks with multiple influence types
• Transfer distance between partitions
• Cluster-C, an algorithm for the large-scale clustering of protein sequences based on the extraction of maximal cliques
• A review on algorithms for maximum clique problems
• Online summarization of dynamic graphs using subjective interestingness for sequential data
• Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs
• A game-theoretic approach to graph clustering
• Finding maximum subgraphs with relatively large vertex connectivity
• Graph clustering
• On the parameterized complexity of non-hereditary relaxations of clique
• Finding weighted k-truss communities in large networks

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

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