Generalized median string computation by means of string embedding in vector spaces
► Generalized median string is an important concept in structural pattern recognition. ► We present an approximate method for the np-hard generalized median string problem. ► Superior performance is demonstrated against other methods in a series of experiments. In structural pattern recognition the...
Saved in:
| Published in: | Pattern recognition letters Vol. 33; no. 7; pp. 842 - 852 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article Publication |
| Language: | English |
| Published: |
Elsevier B.V
01.05.2012
|
| Subjects: | |
| ISSN: | 0167-8655, 1872-7344 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | ► Generalized median string is an important concept in structural pattern recognition. ► We present an approximate method for the np-hard generalized median string problem. ► Superior performance is demonstrated against other methods in a series of experiments.
In structural pattern recognition the median string has been established as a useful tool to represent a set of strings. However, its exact computation is complex and of high computational burden. In this paper we propose a new approach for the computation of median string based on string embedding. Strings are embedded into a vector space and the median is computed in the vector domain. We apply three different inverse transformations to go from the vector domain back to the string domain in order to obtain a final approximation of the median string. All of them are based on the weighted mean of a pair of strings. Experiments show that we succeed to compute good approximations of the median string. |
|---|---|
| AbstractList | In structural pattern recognition the median string has been established as a useful tool to represent a set of strings. However, its exact computation is complex and of high computational burden. In this paper we propose a new approach for the computation of median string based on string embedding. Strings are embedded into a vector space and the median is computed in the vector domain. We apply three different inverse transformations to go from the vector domain back to the string domain in order to obtain a final approximation of the median string. All of them are based on the weighted mean of a pair of strings. Experiments show that we succeed to compute good approximations of the median string.
Peer Reviewed ► Generalized median string is an important concept in structural pattern recognition. ► We present an approximate method for the np-hard generalized median string problem. ► Superior performance is demonstrated against other methods in a series of experiments. In structural pattern recognition the median string has been established as a useful tool to represent a set of strings. However, its exact computation is complex and of high computational burden. In this paper we propose a new approach for the computation of median string based on string embedding. Strings are embedded into a vector space and the median is computed in the vector domain. We apply three different inverse transformations to go from the vector domain back to the string domain in order to obtain a final approximation of the median string. All of them are based on the weighted mean of a pair of strings. Experiments show that we succeed to compute good approximations of the median string. |
| Author | Jiang, Xiaoyi Ferrer, Miquel Wentker, Jöran |
| Author_xml | – sequence: 1 givenname: Xiaoyi surname: Jiang fullname: Jiang, Xiaoyi email: xjiang@math.uni-muenster.de organization: Department of Mathematics and Computer Science, University of Münster Einsteinstrasse 62, 48149 Münster, Germany – sequence: 2 givenname: Jöran surname: Wentker fullname: Wentker, Jöran organization: Department of Mathematics and Computer Science, University of Münster Einsteinstrasse 62, 48149 Münster, Germany – sequence: 3 givenname: Miquel surname: Ferrer fullname: Ferrer, Miquel organization: Centre de Visió per Computador, Departament de Ciències de la Computació Universitat Autònoma de Barcelona, 08193 Bellaterra, Spain |
| BookMark | eNqFkMFKAzEQhoNUsFbfwMO-wK6ZJLvZehCkaBUKHtRzSGdnJaXNliQt6NO7SyuCBz0MmTD_NzDfORv5zhNjV8AL4FBdr4qtTYGwEByg4LrgvDphY6i1yLVUasTGfUzndVWWZ-w8xhXvE3Jaj9nLnDwFu3af1GQbapz1WUzB-fcMu812l2xync-WH_3Q-ph17feYNktqmqFzPtsTpi5kcWuR4gU7be060uXxnbC3h_vX2WO-eJ4_ze4WOSpQKZfYLCtey6ZVnHhdVlQKKyrdyKnVJbZTWYOCVgFyJTRgjVaUS0ElKJzKqpUTBoe9GHdo-vspoE2ms-7nM5TgWhgBoEH2jDoyoYsxUGu2wW1s-DDAzSDTrMxBphlkGq7NoGrCbn5h6A5qUrBu_R98e4Cpl7F3FExERx572300maZzfy_4Aky5lTI |
| CitedBy_id | crossref_primary_10_1016_j_patcog_2013_08_019 crossref_primary_10_1016_j_patrec_2018_08_027 crossref_primary_10_1007_s10044_012_0304_8 crossref_primary_10_1016_j_patrec_2013_09_014 crossref_primary_10_1109_TSMC_2019_2896657 crossref_primary_10_1016_j_patrec_2019_05_015 crossref_primary_10_1016_j_compbiomed_2017_12_017 crossref_primary_10_1016_j_patcog_2014_07_019 crossref_primary_10_1016_j_patrec_2020_11_003 crossref_primary_10_1109_ACCESS_2021_3137767 crossref_primary_10_1109_TPAMI_2022_3202565 crossref_primary_10_1016_j_neucom_2014_09_041 crossref_primary_10_1016_j_jcss_2019_07_003 crossref_primary_10_1016_j_patrec_2019_02_004 |
| Cites_doi | 10.1007/978-1-4471-0833-7_39 10.1109/34.954604 10.1109/34.406656 10.1007/s10044-002-0184-4 10.1145/321796.321811 10.1016/0167-8655(85)90061-3 10.1007/BF01587094 10.1007/s100440200003 10.1007/978-3-540-89689-0_47 10.1016/j.patcog.2009.10.013 10.1137/1025045 10.1109/34.232078 10.1007/11815921_31 10.1007/978-3-642-03767-2_42 10.1007/3-540-70659-3_14 10.1016/S0167-8655(01)00062-9 10.1016/S1570-8667(03)00011-X 10.1016/j.jda.2004.08.015 10.1006/cviu.1996.0502 10.1016/j.cviu.2010.12.010 10.1007/BF02187906 10.1109/ICPR.2000.906220 10.1089/cmb.1994.1.337 |
| ContentType | Journal Article Publication |
| Contributor | Universitat Politècnica de Catalunya. Departament d'Arquitectura de Computadors Universitat Politècnica de Catalunya. DAMA-UPC - Data Management Group |
| Contributor_xml | – sequence: 1 fullname: Universitat Politècnica de Catalunya. Departament d'Arquitectura de Computadors – sequence: 2 fullname: Universitat Politècnica de Catalunya. DAMA-UPC - Data Management Group |
| Copyright | 2011 Elsevier B.V. Attribution-NonCommercial-NoDerivs 3.0 Spain info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by-nc-nd/3.0/es |
| Copyright_xml | – notice: 2011 Elsevier B.V. – notice: Attribution-NonCommercial-NoDerivs 3.0 Spain info:eu-repo/semantics/openAccess <a href="http://creativecommons.org/licenses/by-nc-nd/3.0/es/">http://creativecommons.org/licenses/by-nc-nd/3.0/es/</a> |
| DBID | AAYXX CITATION XX2 |
| DOI | 10.1016/j.patrec.2011.07.006 |
| DatabaseName | CrossRef Recercat |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science |
| EISSN | 1872-7344 |
| EndPage | 852 |
| ExternalDocumentID | oai_recercat_cat_2072_211713 10_1016_j_patrec_2011_07_006 S0167865511002194 |
| GroupedDBID | --M .DC .~1 0R~ 123 1RT 1~. 1~5 4.4 457 4G. 53G 5VS 7-5 71M 8P~ 9JN AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAXUO AAYFN ABBOA ABFNM ABFRF ABJNI ABMAC ABXDB ABYKQ ACDAQ ACGFO ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADMUD ADTZH AEBSH AECPX AEFWE AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD AXJTR BJAXD BKOJK BLXMC CS3 DU5 EBS EFJIC EFLBG EO8 EO9 EP2 EP3 F5P FDB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HZ~ J1W JJJVA KOM LG9 LY1 M41 MO0 N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 RIG RNS ROL SDF SDG SDP SES SPC SPCBC SST SSV SSZ T5K TN5 UNMZH WH7 XPP ZMT ~G- --K 1B1 29O 9DU AAQXK AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADJOM ADMXK ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS EJD FEDTE FGOYB HLZ HVGLF IHE R2- RPZ SBC SDS SEW VOH WUQ Y6R ~HD XX2 |
| ID | FETCH-LOGICAL-c414t-3cdb6083df40e0856e52a267d39a75cf938141f41c04271c8ca25b2e514c936f3 |
| ISICitedReferencesCount | 25 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000302973700006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0167-8655 |
| IngestDate | Fri Nov 07 13:57:22 EST 2025 Sat Nov 29 03:58:35 EST 2025 Tue Nov 18 21:35:41 EST 2025 Fri Feb 23 02:26:36 EST 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 7 |
| Keywords | Lower bound Embedding String Vector space Generalized median |
| Language | English |
| License | https://www.elsevier.com/tdm/userlicense/1.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c414t-3cdb6083df40e0856e52a267d39a75cf938141f41c04271c8ca25b2e514c936f3 |
| OpenAccessLink | https://recercat.cat/handle/2072/211713 |
| PageCount | 11 |
| ParticipantIDs | csuc_recercat_oai_recercat_cat_2072_211713 crossref_primary_10_1016_j_patrec_2011_07_006 crossref_citationtrail_10_1016_j_patrec_2011_07_006 elsevier_sciencedirect_doi_10_1016_j_patrec_2011_07_006 |
| PublicationCentury | 2000 |
| PublicationDate | 2012-05-01 |
| PublicationDateYYYYMMDD | 2012-05-01 |
| PublicationDate_xml | – month: 05 year: 2012 text: 2012-05-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationTitle | Pattern recognition letters |
| PublicationYear | 2012 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Nicolas, Rivals (b0135) 2005; 3 Wagner, Fischer (b0170) 1974; 21 Sim, Park (b0150) 2003; 1 Ferrer, Karatzas, Valveny, Bardaj, Bunke (b0045) 2011; 115 Jiang, Münger, Bunke (b0075) 2001; 23 Ferrer, M., Valveny, E., Serratosa, F., Bardaj, I., Bunke, H., 2009. Graph-based k-means clustering: A comparison of the set median versus the generalized median graph. In: Jiang, X., Petkov, N. (Eds.), Proceedings of CAIP, pp. 342–350. Bunke, Sanfeliu (b0010) 1990 Bunke, Jiang, Abegglen, Kandel (b0015) 2002; 5 Kruskal (b0100) 1983; 25 Vidal, Marzal, Aibar (b0165) 1995; 17 Marti, Bunke (b0115) 2001 Wang, Jiang (b0175) 1994; 1 Fred, A., Leitao, J., 1998. A comparative study of string dissimilarity measures in structural clustering. In: Proceedings of International Conference on Document Analysis and Recognition, pp. 385–394. (b0145) 1983 Hakimi (b0060) 2000 Gusfield (b0055) 1997 Jiang, Abegglen, Bunke, Csirik (b0080) 2003; 6 Juan, Vidal (b0090) 1998 Wesolowsky (b0185) 1993; 1 Casacuberta, F., de Antoni, M., 1997. A greedy algorithm for computing approximate median strings. In: Proceedings of National Symposium on Pattern Recognition and Image Analysis, pp. 193–198. Mico, Oncina (b0130) 2001; 22 Stephen (b0160) 1994 Chandrasekaran, Tamir (b0025) 1989; 44 Bajaj (b0005) 1988; 3 Kohonen (b0095) 1985; 3 Jiang, Bunke (b0070) 2010 Spillmann, B., Neuhaus, M., Bunke, H., Pekalska, E., Duin, R., 2006. Transforming strings to vector spaces using prototype selection. In: Proceedings of SSPR/SPR, pp. 287–296. Martinez-Hinarejos, C., Juan, A., Casacuberta, F., 2000. Use of median string for classification. In: Proceedings of International Conference on Pattern Recognition, pp. 907–910. Marzal, Vidal (b0125) 1993; 15 Ferrer, Valveny, Serratosa, Riesen, Bunke (b0040) 2010; 43 Jiang, X., Bunke, H., 2002. Optimal lower bound for generalized median problems in metric space. In: Caelli, T., Amin, A., Duin, R., Kamel, M., de Ridder, D. (Eds.), Structural, Syntactic, and Statistical Pattern Recognition. pp. 143–151. Lopresti, Zhou (b0110) 1997; 67 Olivares-Rodriguez, C., Oncina, J., 2008. A stochastic approach to median string computation. In: Proceedings of SSPR/SPR, pp. 431–440. Jiang, Bunke, Csirik (b0085) 2004 Weiszfeld (b0180) 1937; 43 de la Higuera, Casacuberta (b0030) 2000; 230 Kruzslicz (b0105) 1999; 14 Bajaj (10.1016/j.patrec.2011.07.006_b0005) 1988; 3 Wesolowsky (10.1016/j.patrec.2011.07.006_b0185) 1993; 1 de la Higuera (10.1016/j.patrec.2011.07.006_b0030) 2000; 230 Juan (10.1016/j.patrec.2011.07.006_b0090) 1998 Hakimi (10.1016/j.patrec.2011.07.006_b0060) 2000 10.1016/j.patrec.2011.07.006_b0050 Gusfield (10.1016/j.patrec.2011.07.006_b0055) 1997 Jiang (10.1016/j.patrec.2011.07.006_b0070) 2010 Bunke (10.1016/j.patrec.2011.07.006_b0010) 1990 10.1016/j.patrec.2011.07.006_b0065 10.1016/j.patrec.2011.07.006_b0120 Vidal (10.1016/j.patrec.2011.07.006_b0165) 1995; 17 Bunke (10.1016/j.patrec.2011.07.006_b0015) 2002; 5 Stephen (10.1016/j.patrec.2011.07.006_b0160) 1994 Ferrer (10.1016/j.patrec.2011.07.006_b0040) 2010; 43 Lopresti (10.1016/j.patrec.2011.07.006_b0110) 1997; 67 Ferrer (10.1016/j.patrec.2011.07.006_b0045) 2011; 115 Sim (10.1016/j.patrec.2011.07.006_b0150) 2003; 1 Wang (10.1016/j.patrec.2011.07.006_b0175) 1994; 1 Chandrasekaran (10.1016/j.patrec.2011.07.006_b0025) 1989; 44 Marti (10.1016/j.patrec.2011.07.006_b0115) 2001 Mico (10.1016/j.patrec.2011.07.006_b0130) 2001; 22 Kohonen (10.1016/j.patrec.2011.07.006_b0095) 1985; 3 Wagner (10.1016/j.patrec.2011.07.006_b0170) 1974; 21 Weiszfeld (10.1016/j.patrec.2011.07.006_b0180) 1937; 43 Jiang (10.1016/j.patrec.2011.07.006_b0085) 2004 Kruzslicz (10.1016/j.patrec.2011.07.006_b0105) 1999; 14 (10.1016/j.patrec.2011.07.006_b0145) 1983 10.1016/j.patrec.2011.07.006_b0140 10.1016/j.patrec.2011.07.006_b0020 Nicolas (10.1016/j.patrec.2011.07.006_b0135) 2005; 3 10.1016/j.patrec.2011.07.006_b0155 10.1016/j.patrec.2011.07.006_b0035 Kruskal (10.1016/j.patrec.2011.07.006_b0100) 1983; 25 Marzal (10.1016/j.patrec.2011.07.006_b0125) 1993; 15 Jiang (10.1016/j.patrec.2011.07.006_b0075) 2001; 23 Jiang (10.1016/j.patrec.2011.07.006_b0080) 2003; 6 |
| References_xml | – volume: 5 start-page: 23 year: 2002 end-page: 30 ident: b0015 article-title: On the weighted mean of a pair of strings publication-title: Pattern Anal. Appl. – volume: 17 start-page: 899 year: 1995 end-page: 902 ident: b0165 article-title: Fast computation of normalized edit distances publication-title: IEEE Trans. Pattern Anal. Mach. Intell. – year: 1983 ident: b0145 publication-title: Time Warps, String Edits, and Macromolecules: The Theory and Practice of String Comparison – reference: Jiang, X., Bunke, H., 2002. Optimal lower bound for generalized median problems in metric space. In: Caelli, T., Amin, A., Duin, R., Kamel, M., de Ridder, D. (Eds.), Structural, Syntactic, and Statistical Pattern Recognition. pp. 143–151. – start-page: 388 year: 2001 end-page: 398 ident: b0115 article-title: Use of positional information in sequence alignment for multiple classifier combination publication-title: Proceedings of Multiple Classifier Combination – start-page: 905 year: 1998 end-page: 912 ident: b0090 article-title: Fast median search in metric spaces publication-title: Advances in Pattern Recognition – reference: Ferrer, M., Valveny, E., Serratosa, F., Bardaj, I., Bunke, H., 2009. Graph-based k-means clustering: A comparison of the set median versus the generalized median graph. In: Jiang, X., Petkov, N. (Eds.), Proceedings of CAIP, pp. 342–350. – volume: 43 start-page: 1642 year: 2010 end-page: 1655 ident: b0040 article-title: Generalized median graph computation by means of graph embedding in vector spaces publication-title: Pattern Recognit. – reference: Olivares-Rodriguez, C., Oncina, J., 2008. A stochastic approach to median string computation. In: Proceedings of SSPR/SPR, pp. 431–440. – volume: 3 start-page: 390 year: 2005 end-page: 415 ident: b0135 article-title: Hardness results for the center and median string problems under the weighted and unweighted edit distances publication-title: J. Discrete Algor. – volume: 22 start-page: 1145 year: 2001 end-page: 1151 ident: b0130 article-title: An approximate median search algorithm in nonmetric spaces publication-title: Pattern Recognition Lett. – volume: 14 start-page: 331 year: 1999 end-page: 339 ident: b0105 article-title: Improved greedy algorithm for computing approximate median strings publication-title: Acta Cybernetica – year: 2000 ident: b0060 article-title: Location Theory – volume: 115 start-page: 919 year: 2011 end-page: 928 ident: b0045 article-title: A generic framework for median graph computation based on a recursive embedding approach publication-title: Computer Vision and Image Understanding – reference: Martinez-Hinarejos, C., Juan, A., Casacuberta, F., 2000. Use of median string for classification. In: Proceedings of International Conference on Pattern Recognition, pp. 907–910. – volume: 25 start-page: 201 year: 1983 end-page: 237 ident: b0100 article-title: An overview of sequence comparison: Time warps, string edits, and macromolecules publication-title: SIAM Reviews – reference: Fred, A., Leitao, J., 1998. A comparative study of string dissimilarity measures in structural clustering. In: Proceedings of International Conference on Document Analysis and Recognition, pp. 385–394. – volume: 3 start-page: 177 year: 1988 end-page: 191 ident: b0005 article-title: The algebraic degree of geometric optimization problems publication-title: Discrete Comput. Geom. – volume: 3 start-page: 309 year: 1985 end-page: 313 ident: b0095 article-title: Median strings publication-title: Pattern Recognition Lett. – volume: 6 start-page: 185 year: 2003 end-page: 193 ident: b0080 article-title: Dynamic computation of generalized median strings publication-title: Pattern Anal. Appl. – start-page: 173 year: 2004 end-page: 192 ident: b0085 article-title: Median strings: A review publication-title: Data Mining in Time Series Databases – volume: 15 start-page: 926 year: 1993 end-page: 932 ident: b0125 article-title: Computation of normalized edit distance and applications publication-title: IEEE Trans. Pattern Anal. Mach. Intell. – year: 1990 ident: b0010 article-title: Syntactic and Structural Pattern Recognition Theory and Applications – volume: 67 start-page: 39 year: 1997 end-page: 47 ident: b0110 article-title: Using consensus sequence voting to correct ocr errors publication-title: Computer Vision and Image Understanding – volume: 1 start-page: 337 year: 1994 end-page: 348 ident: b0175 article-title: On the complexity of multiple sequence alignment publication-title: J. Comput. Biol. – volume: 230 start-page: 739 year: 2000 end-page: 748 ident: b0030 article-title: Topology of strings: Median string is NP-complete publication-title: Theor. Comput. Sci. – volume: 1 start-page: 111 year: 2003 end-page: 117 ident: b0150 article-title: The consensus string problem for a metric is NP-complete publication-title: J. Discrete Algor. – year: 1994 ident: b0160 article-title: String Searching Algorithms – volume: 43 start-page: 355 year: 1937 end-page: 386 ident: b0180 article-title: Sur le point pour lequel la somme des distances de n points donnés est minimum publication-title: Tohoku Math. J. – start-page: 1 year: 2010 end-page: 16 ident: b0070 article-title: Learning by generalized median concept publication-title: Pattern Recognition and Machine Vision – reference: Casacuberta, F., de Antoni, M., 1997. A greedy algorithm for computing approximate median strings. In: Proceedings of National Symposium on Pattern Recognition and Image Analysis, pp. 193–198. – reference: Spillmann, B., Neuhaus, M., Bunke, H., Pekalska, E., Duin, R., 2006. Transforming strings to vector spaces using prototype selection. In: Proceedings of SSPR/SPR, pp. 287–296. – volume: 44 start-page: 293 year: 1989 end-page: 295 ident: b0025 article-title: Open questions concerning weiszfelds algorithm for the Fermat–Weber location problem publication-title: Math. Program. – volume: 1 start-page: 5 year: 1993 end-page: 23 ident: b0185 article-title: The Weber problem: History and perspective publication-title: Location Sci. – year: 1997 ident: b0055 publication-title: Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology – volume: 21 start-page: 168 year: 1974 end-page: 173 ident: b0170 article-title: The string-to-string correction problem publication-title: J. ACM – volume: 23 start-page: 1144 year: 2001 end-page: 1151 ident: b0075 article-title: On median graphs: Properties, algorithms, and applications publication-title: IEEE Trans. Pattern Anal. Machine Intell. – ident: 10.1016/j.patrec.2011.07.006_b0050 doi: 10.1007/978-1-4471-0833-7_39 – year: 2000 ident: 10.1016/j.patrec.2011.07.006_b0060 – volume: 23 start-page: 1144 issue: 10 year: 2001 ident: 10.1016/j.patrec.2011.07.006_b0075 article-title: On median graphs: Properties, algorithms, and applications publication-title: IEEE Trans. Pattern Anal. Machine Intell. doi: 10.1109/34.954604 – volume: 17 start-page: 899 issue: 9 year: 1995 ident: 10.1016/j.patrec.2011.07.006_b0165 article-title: Fast computation of normalized edit distances publication-title: IEEE Trans. Pattern Anal. Mach. Intell. doi: 10.1109/34.406656 – year: 1990 ident: 10.1016/j.patrec.2011.07.006_b0010 – volume: 6 start-page: 185 issue: 3 year: 2003 ident: 10.1016/j.patrec.2011.07.006_b0080 article-title: Dynamic computation of generalized median strings publication-title: Pattern Anal. Appl. doi: 10.1007/s10044-002-0184-4 – volume: 21 start-page: 168 issue: 1 year: 1974 ident: 10.1016/j.patrec.2011.07.006_b0170 article-title: The string-to-string correction problem publication-title: J. ACM doi: 10.1145/321796.321811 – volume: 3 start-page: 309 year: 1985 ident: 10.1016/j.patrec.2011.07.006_b0095 article-title: Median strings publication-title: Pattern Recognition Lett. doi: 10.1016/0167-8655(85)90061-3 – volume: 44 start-page: 293 year: 1989 ident: 10.1016/j.patrec.2011.07.006_b0025 article-title: Open questions concerning weiszfelds algorithm for the Fermat–Weber location problem publication-title: Math. Program. doi: 10.1007/BF01587094 – volume: 230 start-page: 739 issue: 1/2 year: 2000 ident: 10.1016/j.patrec.2011.07.006_b0030 article-title: Topology of strings: Median string is NP-complete publication-title: Theor. Comput. Sci. – volume: 5 start-page: 23 issue: 1 year: 2002 ident: 10.1016/j.patrec.2011.07.006_b0015 article-title: On the weighted mean of a pair of strings publication-title: Pattern Anal. Appl. doi: 10.1007/s100440200003 – ident: 10.1016/j.patrec.2011.07.006_b0140 doi: 10.1007/978-3-540-89689-0_47 – volume: 43 start-page: 1642 year: 2010 ident: 10.1016/j.patrec.2011.07.006_b0040 article-title: Generalized median graph computation by means of graph embedding in vector spaces publication-title: Pattern Recognit. doi: 10.1016/j.patcog.2009.10.013 – volume: 25 start-page: 201 issue: 2 year: 1983 ident: 10.1016/j.patrec.2011.07.006_b0100 article-title: An overview of sequence comparison: Time warps, string edits, and macromolecules publication-title: SIAM Reviews doi: 10.1137/1025045 – volume: 15 start-page: 926 issue: 9 year: 1993 ident: 10.1016/j.patrec.2011.07.006_b0125 article-title: Computation of normalized edit distance and applications publication-title: IEEE Trans. Pattern Anal. Mach. Intell. doi: 10.1109/34.232078 – ident: 10.1016/j.patrec.2011.07.006_b0155 doi: 10.1007/11815921_31 – ident: 10.1016/j.patrec.2011.07.006_b0035 doi: 10.1007/978-3-642-03767-2_42 – year: 1997 ident: 10.1016/j.patrec.2011.07.006_b0055 – start-page: 905 year: 1998 ident: 10.1016/j.patrec.2011.07.006_b0090 article-title: Fast median search in metric spaces – year: 1983 ident: 10.1016/j.patrec.2011.07.006_b0145 – ident: 10.1016/j.patrec.2011.07.006_b0020 – ident: 10.1016/j.patrec.2011.07.006_b0065 doi: 10.1007/3-540-70659-3_14 – volume: 1 start-page: 5 year: 1993 ident: 10.1016/j.patrec.2011.07.006_b0185 article-title: The Weber problem: History and perspective publication-title: Location Sci. – volume: 22 start-page: 1145 issue: 10 year: 2001 ident: 10.1016/j.patrec.2011.07.006_b0130 article-title: An approximate median search algorithm in nonmetric spaces publication-title: Pattern Recognition Lett. doi: 10.1016/S0167-8655(01)00062-9 – volume: 1 start-page: 111 issue: 1 year: 2003 ident: 10.1016/j.patrec.2011.07.006_b0150 article-title: The consensus string problem for a metric is NP-complete publication-title: J. Discrete Algor. doi: 10.1016/S1570-8667(03)00011-X – volume: 3 start-page: 390 year: 2005 ident: 10.1016/j.patrec.2011.07.006_b0135 article-title: Hardness results for the center and median string problems under the weighted and unweighted edit distances publication-title: J. Discrete Algor. doi: 10.1016/j.jda.2004.08.015 – volume: 67 start-page: 39 issue: 1 year: 1997 ident: 10.1016/j.patrec.2011.07.006_b0110 article-title: Using consensus sequence voting to correct ocr errors publication-title: Computer Vision and Image Understanding doi: 10.1006/cviu.1996.0502 – start-page: 388 year: 2001 ident: 10.1016/j.patrec.2011.07.006_b0115 article-title: Use of positional information in sequence alignment for multiple classifier combination – year: 1994 ident: 10.1016/j.patrec.2011.07.006_b0160 – volume: 43 start-page: 355 year: 1937 ident: 10.1016/j.patrec.2011.07.006_b0180 article-title: Sur le point pour lequel la somme des distances de n points donnés est minimum publication-title: Tohoku Math. J. – volume: 115 start-page: 919 issue: 7 year: 2011 ident: 10.1016/j.patrec.2011.07.006_b0045 article-title: A generic framework for median graph computation based on a recursive embedding approach publication-title: Computer Vision and Image Understanding doi: 10.1016/j.cviu.2010.12.010 – volume: 3 start-page: 177 issue: 2 year: 1988 ident: 10.1016/j.patrec.2011.07.006_b0005 article-title: The algebraic degree of geometric optimization problems publication-title: Discrete Comput. Geom. doi: 10.1007/BF02187906 – ident: 10.1016/j.patrec.2011.07.006_b0120 doi: 10.1109/ICPR.2000.906220 – start-page: 1 year: 2010 ident: 10.1016/j.patrec.2011.07.006_b0070 article-title: Learning by generalized median concept – volume: 14 start-page: 331 year: 1999 ident: 10.1016/j.patrec.2011.07.006_b0105 article-title: Improved greedy algorithm for computing approximate median strings publication-title: Acta Cybernetica – start-page: 173 year: 2004 ident: 10.1016/j.patrec.2011.07.006_b0085 article-title: Median strings: A review – volume: 1 start-page: 337 issue: 4 year: 1994 ident: 10.1016/j.patrec.2011.07.006_b0175 article-title: On the complexity of multiple sequence alignment publication-title: J. Comput. Biol. doi: 10.1089/cmb.1994.1.337 |
| SSID | ssj0006398 |
| Score | 2.1584022 |
| Snippet | ► Generalized median string is an important concept in structural pattern recognition. ► We present an approximate method for the np-hard generalized median... In structural pattern recognition the median string has been established as a useful tool to represent a set of strings. However, its exact computation is... |
| SourceID | csuc crossref elsevier |
| SourceType | Open Access Repository Enrichment Source Index Database Publisher |
| StartPage | 842 |
| SubjectTerms | Algorismes computacionals Algorithms and architectures for advanced scientific computing Algorísmica i teoria de la complexitat Anàlisi numèrica Computer algorithms Embedding Generalized median Informàtica Informàtica teòrica Lower bound Matemàtiques i estadística Modelització matemàtica Percepció de les estructures Processament de dades String Vector space Àrees temàtiques de la UPC |
| Title | Generalized median string computation by means of string embedding in vector spaces |
| URI | https://dx.doi.org/10.1016/j.patrec.2011.07.006 https://recercat.cat/handle/2072/211713 |
| Volume | 33 |
| WOSCitedRecordID | wos000302973700006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1872-7344 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0006398 issn: 0167-8655 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3Nb9MwFLdKxwEOfAwQ5Us-cAIFNbETO8eBNsEkpkkbUm9WYjtSpi6tsrTauPKP815st4FKfEkcGrVOnUR5vzz_8vzez4S8LniVlLmMI5xEijhnJirLjEfwjOcFy-IiN6ZfbEKcnMjZLD8djb6FWpj1XDSNvL7Ol__V1NAGxsbS2b8w9-ag0ADfweiwBbPD9o8M74Wk669AJfu6kAYLQnxt7XLlswuBdV7awuXA-d32srQm1Lis-2j-W_A32mcZegZ72gtyYhGMzzyCg837mqBtMmLtg9Czuljc1NvJn6bzORzHOD__Pmu30DyyrV9Y-zMqys6H0QhM60iH0YjdMhkXtQRvjBWwbtBxnlYKoPbMiT8GV-w0MTzkxMCvSifBFYZoJ3q74_1dIOLiHU4jWO31WVGi8iex7X74PsOrwotC0Tzw2_wW2UtEmssx2Tv4dDg73gzoQOJkkIjHDqECs08T3D3XDwxnrK9WekB0BuTl_AG559866IFDy0Myss0-uR9W9KDewe-TuwN5ykfkbAAl6qBEHVboAEq0vKE9lOiiCrs3UKJ1Qx2UqIPSY_Ll6PD8w8fIL8IRaR7zLmLalBnwdFPxqQV-ntk0KZJMGJYXItVVDpSPxxWPNa7aEmupiyQtEwtEXOcsq9gTMm4WjX1KKPCxnDNmZWIMZ1Por-GlyYg0NYW1spwQFm6c0l6hHhdKmauQinih3O1WeLvVFFMnsgmJNr2WTqHlN_9_gzZR0GxbXXQKBdY3P_CTTEWikjgWMZsQESynPCV1VFMB5n55mmf_3PM5ubN9sl6Qcdeu7EtyW6-7-qp95cH5HfMns-0 |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Generalized+median+string+computation+by+means+of+string+embedding+in+vector+spaces&rft.jtitle=Pattern+recognition+letters&rft.au=Jiang%2C+Xiaoyi&rft.au=Wentker%2C+J%C3%B6ran&rft.au=Ferrer%2C+Miquel&rft.date=2012-05-01&rft.pub=Elsevier+B.V&rft.issn=0167-8655&rft.eissn=1872-7344&rft.volume=33&rft.issue=7&rft.spage=842&rft.epage=852&rft_id=info:doi/10.1016%2Fj.patrec.2011.07.006&rft.externalDocID=S0167865511002194 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0167-8655&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0167-8655&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0167-8655&client=summon |