Assessing the best edit in perturbation-based iterative refinement algorithms to compute the median string

@article{Mirabal2019AssessingTB,
  title={Assessing the best edit in perturbation-based iterative refinement algorithms to compute the median string},
  author={Pedro Mirabal and Jos{\'e} Ignacio Abreu Salas and Diego Seco},
  journal={Pattern Recognit. Lett.},
  year={2019},
  volume={120},
  pages={104-111}
}
  • Pedro Mirabal, José Ignacio Abreu Salas, Diego Seco
  • Published in Pattern Recognit. Lett. 2019
  • Computer Science, Mathematics
  • Abstract Different pattern recognition techniques such as clustering, k-nearest neighbors classification or instance reduction algorithms require prototypes to represent pattern classes. In many applications, strings are used to encode instances, for example, in contour representations or in biological data such as DNA, RNA and protein sequences. Median strings have been used as representatives of a set of strings in different domains. Finding the median string is an NP-Complete problem for… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Citations

    Publications citing this paper.

    Pivot Selection for Median String Problem

    VIEW 7 EXCERPTS
    CITES BACKGROUND & METHODS

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 18 REFERENCES

    A learning model for multiple-prototype classification of strings

    • R. Cárdenas
    • Computer Science
    • Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004.
    • 2004
    VIEW 2 EXCERPTS

    On the Weighted Mean of a Pair of Strings

    VIEW 1 EXCERPT