Local multiple alignment via subgraph enumeration

DOI10.1016/S0166-218X(96)00072-8zbMath0899.92019MaRDI QIDQ5961633

No author found.

Publication date: 11 November 1998

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

flatteningblockingmolecular biologychainingmaximal cliquemultiple alignmentssequence comparisonsubgraph enumeration

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Biochemistry, molecular biology (92C40) Computational methods for problems pertaining to biology (92-08) Software, source code, etc. for problems pertaining to biology (92-04)

Uses Software

• ClustalW
• Algorithm 457

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On generating all maximal independent sets
• A time-efficient, linar-space local similarity algorithm
• Efficient methods for multiple sequence alignment with guaranteed error bounds
• Multiple sequence comparison and consistency on multipartite graphs
• Linear-space algorithms that build local alignments from fragments
• Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
• A New Algorithm for Generating All the Maximal Independent Sets
• Efficient Algorithms for Listing Combinatorial Structures
• Sparse dynamic programming II
• Algorithm 457: finding all cliques of an undirected graph
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

This page was built for publication: Local multiple alignment via subgraph enumeration