Topology of strings: Median string is NP-complete-Reference-Cited by-同舟云学术

Topology of strings: Median string is NP-complete

Published:2000-01 Issue:1-2 Volume:230 Page:39-48
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

de la Higuera C.,Casacuberta F.

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference17 articles.

1. Multiple template modelling of sublexical units;Aibar,1991

2. A.V. Aho, Algorithms for finding patterns in strings, Handbook of Theoretical Computer Science, Elsevier, Amsterdam, 1990, pp. 290–300.

3. F. Casacuberta, M.D. Antonio, A greedy algorithm for computing approximate median strings, in: Proc. VII Spanish Symp. on Pattern Recognition and Image Analysis, Bellaterra, 1997, to appear.

4. A survey of multiple sequence comparison methods;Chan;Bull. Math. Biol.,1992

5. Syntactic Pattern Recognition and Applications;Fu,1982

Cited by 66 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Generalized Median Computation for Consensus Learning: A Brief Survey;Computer Analysis of Images and Patterns;2023

2. Kernel-Based Generalized Median Computation for Consensus Learning;IEEE Transactions on Pattern Analysis and Machine Intelligence;2022

3. Scalable generalized median graph estimation and its manifold use in bioinformatics, clustering, classification, and indexing;Information Systems;2021-09

4. Distance-Preserving Vector Space Embedding for Consensus Learning;IEEE Transactions on Systems, Man, and Cybernetics: Systems;2021-02

5. A lower bound for generalized median based consensus learning using kernel-induced distance functions;Pattern Recognition Letters;2020-12