Simon's congruence pattern matching
The Simon's congruence problem is to determine whether or not two strings have the same set of subsequences of length no greater than a given integer, and the problem can be answered in linear time. We consider the Simon's congruence pattern matching problem that looks for all substrings o...
Uloženo v:
| Vydáno v: | Theoretical computer science Ročník 994; s. 114478 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier B.V
01.05.2024
|
| Témata: | |
| ISSN: | 0304-3975, 1879-2294 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | The Simon's congruence problem is to determine whether or not two strings have the same set of subsequences of length no greater than a given integer, and the problem can be answered in linear time. We consider the Simon's congruence pattern matching problem that looks for all substrings of a text that are congruent to a pattern under the Simon's congruence. We propose a linear time algorithm by reusing results from previous computations with the help of new data structures called X-trees and Y-trees. Moreover, we investigate several variants of the problem such as identifying the shortest substring or subsequence of the text that is congruent to the pattern under the Simon's congruence, or finding frequent matchings. We design efficient algorithms for these problems. We conclude the paper with two open problems: finding the longest congruent subsequence and optimizing the pattern matching problem.
•A polynomial algorithm linear in the length of the text that computes all substrings of the text that is Simon's k-congruent to the pattern.•Efficient algorithms that solve variants of the Simon's congruence pattern matching problem.•A data structure with linear preprocessing time that answers two types of queries related to Simon's congruence pattern matching multiplicities. |
|---|---|
| AbstractList | The Simon's congruence problem is to determine whether or not two strings have the same set of subsequences of length no greater than a given integer, and the problem can be answered in linear time. We consider the Simon's congruence pattern matching problem that looks for all substrings of a text that are congruent to a pattern under the Simon's congruence. We propose a linear time algorithm by reusing results from previous computations with the help of new data structures called X-trees and Y-trees. Moreover, we investigate several variants of the problem such as identifying the shortest substring or subsequence of the text that is congruent to the pattern under the Simon's congruence, or finding frequent matchings. We design efficient algorithms for these problems. We conclude the paper with two open problems: finding the longest congruent subsequence and optimizing the pattern matching problem.
•A polynomial algorithm linear in the length of the text that computes all substrings of the text that is Simon's k-congruent to the pattern.•Efficient algorithms that solve variants of the Simon's congruence pattern matching problem.•A data structure with linear preprocessing time that answers two types of queries related to Simon's congruence pattern matching multiplicities. |
| ArticleNumber | 114478 |
| Author | Han, Yo-Sub Kim, Sungmin Ko, Sang-Ki |
| Author_xml | – sequence: 1 givenname: Sungmin surname: Kim fullname: Kim, Sungmin email: rena_rio@yonsei.ac.kr organization: Department of Computer Science, Yonsei University, 50 Yonsei-Ro, Seodaemun-Gu, Seoul 03722, Republic of Korea – sequence: 2 givenname: Sang-Ki surname: Ko fullname: Ko, Sang-Ki email: sangkiko@uos.ac.kr organization: Department of Artificial Intelligence, University of Seoul, 163 Seoulsiripdae-Ro, Dongdaemun-Gu, Seoul 02504, Republic of Korea – sequence: 3 givenname: Yo-Sub surname: Han fullname: Han, Yo-Sub email: emmous@yonsei.ac.kr organization: Department of Computer Science, Yonsei University, 50 Yonsei-Ro, Seodaemun-Gu, Seoul 03722, Republic of Korea |
| BookMark | eNp9z01LxDAQgOEgK9hd_QHeCh48tSbptGnwJItfsOBBPYd8rik2XZIo-O_tUs_OZU7vMM8arcIULEKXBNcEk-5mqLNONcUUakIAWH-CCtIzXlHKYYUK3GCoGs7aM7ROacDztKwr0NWrH6dwnUo9hX38skHb8iBztjGUo8z6w4f9OTp18jPZi7-9Qe8P92_bp2r38vi8vdtVmnKaK-M0gOpBWWOAAsFSMs4VwapVinREcUUZ77EDahrnuLGGU457aE3bGQ7NBpHlro5TStE6cYh-lPFHECyOSjGIWSmOSrEo5-Z2aez82Le3USTtjwrjo9VZmMn_U_8C4lFbYw |
| Cites_doi | 10.1007/s10878-006-9031-7 10.1016/j.tcs.2023.114078 10.1016/0304-3975(91)90170-7 |
| ContentType | Journal Article |
| Copyright | 2024 Elsevier B.V. |
| Copyright_xml | – notice: 2024 Elsevier B.V. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.tcs.2024.114478 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Computer Science |
| EISSN | 1879-2294 |
| ExternalDocumentID | 10_1016_j_tcs_2024_114478 S0304397524000938 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 123 1B1 1RT 1~. 1~5 4.4 457 4G. 5VS 7-5 71M 8P~ 9JN AABNK AACTN AAEDW AAFTH AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAXUO AAYFN ABAOU ABBOA ABJNI ABMAC ABYKQ ACAZW ACDAQ ACGFS ACRLP ACZNC ADBBV ADEZE AEBSH AEKER AENEX AFKWA AFTJW AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIKHN AITUG AJOXV AKRWK ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ARUGR AXJTR BKOJK BLXMC CS3 DU5 EBS EFJIC EO8 EO9 EP2 EP3 F5P FDB FEDTE FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HVGLF IHE IXB J1W KOM MHUIS MO0 N9A O-L O9- OAUVE OK1 OZT P-8 P-9 P2P PC. Q38 RIG ROL RPZ SCC SDF SDG SES SEW SPC SPCBC SSV SSW T5K TN5 WH7 YNT ZMT ~G- 29Q 9DU AAEDT AAQXK AATTM AAXKI AAYWO AAYXX ABDPE ABEFU ABFNM ABWVN ABXDB ACLOT ACNNM ACRPL ACVFH ADCNI ADMUD ADNMO ADVLN AEIPS AEUPX AEXQZ AFJKZ AFPUW AGHFR AGQPQ AIGII AIIUN AKBMS AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS EFLBG EJD FGOYB G-2 HZ~ LG9 M26 M41 R2- SSZ TAE WUQ ZY4 ~HD |
| ID | FETCH-LOGICAL-c292t-dfc44b84bedd42410aa799b10b5bb161b9b27980f42d3ff9ded9290845d56d943 |
| ISICitedReferencesCount | 3 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001221621400001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0304-3975 |
| IngestDate | Sat Nov 29 07:21:06 EST 2025 Sat Apr 06 16:23:51 EDT 2024 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | String algorithm Simon's congruence Data structure Pattern matching |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c292t-dfc44b84bedd42410aa799b10b5bb161b9b27980f42d3ff9ded9290845d56d943 |
| OpenAccessLink | https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.60 |
| ParticipantIDs | crossref_primary_10_1016_j_tcs_2024_114478 elsevier_sciencedirect_doi_10_1016_j_tcs_2024_114478 |
| PublicationCentury | 2000 |
| PublicationDate | 2024-05-01 2024-05-00 |
| PublicationDateYYYYMMDD | 2024-05-01 |
| PublicationDate_xml | – month: 05 year: 2024 text: 2024-05-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationTitle | Theoretical computer science |
| PublicationYear | 2024 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Sedmidubský, Zezula (br0210) 2017 Adamson, Kosche, Koß, Manea, Siemer (br0010) 2023; vol. 13899 Kim, Han, Ko, Salomaa (br0160) 2023; 972 Garel (br0120) 1993 Surynková, Surynek (br0230) 2016; vol. 10521 Day, Kosche, Manea, Schmid (br0060) 2022; vol. 248 Gawrychowski, Kosche, Koß, Manea, Siemer (br0130) 2021; vol. 187 Fleischer, Kufleitner (br0080) 2018 Farach (br0070) 1997 Fleischmann, Kim, Koß, Manea, Nowotka, Siemer, Wiedenhöft (br0110) 2023; vol. 14235 Agrawal, Gawrychowski (br0020) 2020; vol. 181 Hunt, McIlroy (br0150) 1975; 41 Kim, Han, Ko, Salomaa (br0170) 2023; vol. 13911 Barker, Fleischmann, Harwardt, Manea, Nowotka (br0030) 2020; vol. 12086 Fleischmann, Haschke, Huch, Mayrock, Nowotka (br0090) 2022; vol. 13439 Kim, Ko, Han (br0180) 2022; vol. 248 Beal, Afrin, Farheen, Adjeroh (br0040) 2016; 17 Chan, Zhang, Fung, Ye, Zhu (br0050) 2007; 13 Simon (br0220) 1975 Weis, Immerman (br0240) 2009; 5 Fleischmann, Höfer, Huch, Nowotka (br0100) 2023; vol. 14292 Schwentick, Thérien, Vollmer (br0200) 2001 Schnoebelen, Veron (br0190) 2023; vol. 13899 Hébrard (br0140) 1991; 82 Chan (10.1016/j.tcs.2024.114478_br0050) 2007; 13 Fleischmann (10.1016/j.tcs.2024.114478_br0090) 2022; vol. 13439 Day (10.1016/j.tcs.2024.114478_br0060) 2022; vol. 248 Adamson (10.1016/j.tcs.2024.114478_br0010) 2023; vol. 13899 Kim (10.1016/j.tcs.2024.114478_br0170) 2023; vol. 13911 Schwentick (10.1016/j.tcs.2024.114478_br0200) 2001 Agrawal (10.1016/j.tcs.2024.114478_br0020) 2020; vol. 181 Hébrard (10.1016/j.tcs.2024.114478_br0140) 1991; 82 Sedmidubský (10.1016/j.tcs.2024.114478_br0210) 2017 Hunt (10.1016/j.tcs.2024.114478_br0150) 1975; 41 Weis (10.1016/j.tcs.2024.114478_br0240) 2009; 5 Gawrychowski (10.1016/j.tcs.2024.114478_br0130) 2021; vol. 187 Barker (10.1016/j.tcs.2024.114478_br0030) 2020; vol. 12086 Fleischmann (10.1016/j.tcs.2024.114478_br0100) 2023; vol. 14292 Simon (10.1016/j.tcs.2024.114478_br0220) 1975 Surynková (10.1016/j.tcs.2024.114478_br0230) 2016; vol. 10521 Kim (10.1016/j.tcs.2024.114478_br0180) 2022; vol. 248 Farach (10.1016/j.tcs.2024.114478_br0070) 1997 Garel (10.1016/j.tcs.2024.114478_br0120) 1993 Kim (10.1016/j.tcs.2024.114478_br0160) 2023; 972 Beal (10.1016/j.tcs.2024.114478_br0040) 2016; 17 Fleischer (10.1016/j.tcs.2024.114478_br0080) 2018 Fleischmann (10.1016/j.tcs.2024.114478_br0110) 2023; vol. 14235 Schnoebelen (10.1016/j.tcs.2024.114478_br0190) 2023; vol. 13899 |
| References_xml | – start-page: 35 year: 1993 end-page: 53 ident: br0120 article-title: Minimal separators of two words publication-title: Proceedings of the – volume: vol. 181 start-page: 4:1 year: 2020 end-page: 4:12 ident: br0020 article-title: A faster subquadratic algorithm for the longest common increasing subsequence problem publication-title: Proceedings of the – volume: vol. 14235 start-page: 155 year: 2023 end-page: 170 ident: br0110 article-title: Matching patterns with variables under Simon's congruence publication-title: Proceedings of the – volume: vol. 10521 start-page: 296 year: 2016 end-page: 311 ident: br0230 article-title: Application of longest common subsequence algorithms to meshing of planar domains with quadrilaterals publication-title: Proceedings of the – volume: vol. 248 start-page: 60:1 year: 2022 end-page: 60:17 ident: br0180 article-title: Simon's congruence pattern matching publication-title: Proceedings of the – volume: vol. 12086 start-page: 14 year: 2020 end-page: 28 ident: br0030 article-title: Scattered factor-universality of words publication-title: Proceedings of the – volume: 82 start-page: 35 year: 1991 end-page: 49 ident: br0140 article-title: An algorithm for distinguishing efficiently bit-strings by their subsequences publication-title: Theor. Comput. Sci. – start-page: 137 year: 1997 end-page: 143 ident: br0070 article-title: Optimal suffix tree construction with large alphabets publication-title: Proceedings of the – volume: vol. 13899 start-page: 60 year: 2023 end-page: 76 ident: br0010 article-title: Longest common subsequence with gap constraints publication-title: Proceedings of the – volume: vol. 187 start-page: 34:1 year: 2021 end-page: 34:18 ident: br0130 article-title: Efficiently testing Simon's congruence publication-title: Proceedings of the – volume: 41 year: 1975 ident: br0150 article-title: An algorithm for differential file comparison publication-title: Comput. Sci. Techn. Rep. – start-page: 214 year: 1975 end-page: 222 ident: br0220 article-title: Piecewise testable events publication-title: Proceedings of the – start-page: 62:1 year: 2018 end-page: 62:13 ident: br0080 article-title: Testing Simon's congruence publication-title: Proceedings of the – volume: vol. 13899 start-page: 274 year: 2023 end-page: 287 ident: br0190 article-title: On arch factorization and subword universality for words and compressed words publication-title: Proceedings of the – volume: 13 start-page: 277 year: 2007 end-page: 288 ident: br0050 article-title: Efficient algorithms for finding a longest common increasing subsequence publication-title: J. Comb. Optim. – volume: vol. 13439 start-page: 57 year: 2022 end-page: 71 ident: br0090 article-title: Nearly publication-title: Proceedings of the – start-page: 239 year: 2001 end-page: 250 ident: br0200 article-title: Partially-ordered two-way automata: a new characterization of DA publication-title: Revised Papers from the – start-page: 372 year: 2017 end-page: 373 ident: br0210 article-title: A web application for subsequence matching in 3d human motion data publication-title: Proceedings of the – volume: 5 year: 2009 ident: br0240 article-title: Structure theorem and strict alternation hierarchy for FO publication-title: Log. Methods Comput. Sci. – volume: 17 start-page: 369 year: 2016 end-page: 381 ident: br0040 article-title: A new algorithm for “the LCS problem” with application in compressing genome resequencing data publication-title: BMC Genomics – volume: vol. 14292 start-page: 190 year: 2023 end-page: 204 ident: br0100 article-title: - publication-title: Proceedings of the – volume: 972 year: 2023 ident: br0160 article-title: On Simon's congruence closure of a string publication-title: Theor. Comput. Sci. – volume: vol. 13911 start-page: 168 year: 2023 end-page: 181 ident: br0170 article-title: On the Simon's congruence neighborhood of languages publication-title: Proceedings of the – volume: vol. 248 start-page: 64:1 year: 2022 end-page: 64:18 ident: br0060 article-title: Subsequences with gap constraints: complexity bounds for matching and analysis problems publication-title: Proceedings of the – volume: vol. 12086 start-page: 14 year: 2020 ident: 10.1016/j.tcs.2024.114478_br0030 article-title: Scattered factor-universality of words – start-page: 35 year: 1993 ident: 10.1016/j.tcs.2024.114478_br0120 article-title: Minimal separators of two words – volume: vol. 187 start-page: 34:1 year: 2021 ident: 10.1016/j.tcs.2024.114478_br0130 article-title: Efficiently testing Simon's congruence – volume: vol. 13911 start-page: 168 year: 2023 ident: 10.1016/j.tcs.2024.114478_br0170 article-title: On the Simon's congruence neighborhood of languages – volume: vol. 13439 start-page: 57 year: 2022 ident: 10.1016/j.tcs.2024.114478_br0090 article-title: Nearly k-universal words - investigating a part of Simon's congruence – start-page: 239 year: 2001 ident: 10.1016/j.tcs.2024.114478_br0200 article-title: Partially-ordered two-way automata: a new characterization of DA – volume: vol. 248 start-page: 64:1 year: 2022 ident: 10.1016/j.tcs.2024.114478_br0060 article-title: Subsequences with gap constraints: complexity bounds for matching and analysis problems – volume: 17 start-page: 369 issue: Supplement 4(544) year: 2016 ident: 10.1016/j.tcs.2024.114478_br0040 article-title: A new algorithm for “the LCS problem” with application in compressing genome resequencing data publication-title: BMC Genomics – volume: vol. 13899 start-page: 274 year: 2023 ident: 10.1016/j.tcs.2024.114478_br0190 article-title: On arch factorization and subword universality for words and compressed words – start-page: 214 year: 1975 ident: 10.1016/j.tcs.2024.114478_br0220 article-title: Piecewise testable events – volume: 41 year: 1975 ident: 10.1016/j.tcs.2024.114478_br0150 article-title: An algorithm for differential file comparison publication-title: Comput. Sci. Techn. Rep. – start-page: 62:1 year: 2018 ident: 10.1016/j.tcs.2024.114478_br0080 article-title: Testing Simon's congruence – volume: vol. 14235 start-page: 155 year: 2023 ident: 10.1016/j.tcs.2024.114478_br0110 article-title: Matching patterns with variables under Simon's congruence – volume: 13 start-page: 277 issue: 3 year: 2007 ident: 10.1016/j.tcs.2024.114478_br0050 article-title: Efficient algorithms for finding a longest common increasing subsequence publication-title: J. Comb. Optim. doi: 10.1007/s10878-006-9031-7 – start-page: 372 year: 2017 ident: 10.1016/j.tcs.2024.114478_br0210 article-title: A web application for subsequence matching in 3d human motion data – volume: vol. 248 start-page: 60:1 year: 2022 ident: 10.1016/j.tcs.2024.114478_br0180 article-title: Simon's congruence pattern matching – volume: vol. 13899 start-page: 60 year: 2023 ident: 10.1016/j.tcs.2024.114478_br0010 article-title: Longest common subsequence with gap constraints – volume: vol. 10521 start-page: 296 year: 2016 ident: 10.1016/j.tcs.2024.114478_br0230 article-title: Application of longest common subsequence algorithms to meshing of planar domains with quadrilaterals – start-page: 137 year: 1997 ident: 10.1016/j.tcs.2024.114478_br0070 article-title: Optimal suffix tree construction with large alphabets – volume: vol. 14292 start-page: 190 year: 2023 ident: 10.1016/j.tcs.2024.114478_br0100 article-title: α-β-factorization and the binary case of Simon's congruence – volume: 972 year: 2023 ident: 10.1016/j.tcs.2024.114478_br0160 article-title: On Simon's congruence closure of a string publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2023.114078 – volume: 5 issue: 3 year: 2009 ident: 10.1016/j.tcs.2024.114478_br0240 article-title: Structure theorem and strict alternation hierarchy for FO2 on words publication-title: Log. Methods Comput. Sci. – volume: 82 start-page: 35 issue: 1 year: 1991 ident: 10.1016/j.tcs.2024.114478_br0140 article-title: An algorithm for distinguishing efficiently bit-strings by their subsequences publication-title: Theor. Comput. Sci. doi: 10.1016/0304-3975(91)90170-7 – volume: vol. 181 start-page: 4:1 year: 2020 ident: 10.1016/j.tcs.2024.114478_br0020 article-title: A faster subquadratic algorithm for the longest common increasing subsequence problem |
| SSID | ssj0000576 |
| Score | 2.4450686 |
| Snippet | The Simon's congruence problem is to determine whether or not two strings have the same set of subsequences of length no greater than a given integer, and the... |
| SourceID | crossref elsevier |
| SourceType | Index Database Publisher |
| StartPage | 114478 |
| SubjectTerms | Data structure Pattern matching Simon's congruence String algorithm |
| Title | Simon's congruence pattern matching |
| URI | https://dx.doi.org/10.1016/j.tcs.2024.114478 |
| Volume | 994 |
| WOSCitedRecordID | wos001221621400001&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: 1879-2294 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000576 issn: 0304-3975 databaseCode: AIEXJ dateStart: 20211209 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1bS8MwFA7eHvTBuzhvFBQEpZKlqUkeRSbeEZwyn8qSNGODdWMb4s_3pEntmAoq-FLaQptyvubk5Nw-hA7sKpBGGMMUlzSkVaVhSsU8NNhIppqGn-ZV_M-37P6eNxriwVPWDXM6AZZl_O1N9P8VargHYNvS2V_A_fFSuAHnADocAXY4_gj4R5C-40mBrW5rkCdK2_ap1vN3DPZpnjw5bpPWx2oZlSd5OPYrYxmi77ocnqzVbZeB-55zKmet8KZd6rJckb30QlBK404FQssUPufp-lTt4iqsbBRFOKaTk9QpTM5ESIgjKi40qnCXn7SzcxR0TkbKNkon1DYqpo7BZ6Lp9aMdyw5lU1yxiPg0miUsFqC3Zs-uao3rcrWNmYtH-28rItd5Dt_EQF_bHmP2RH0ZLfqNQHDmAFxBU2m2ipYKko3A69xVtHD30Vh3uIb2c3QPh0GJbeCxDQps19HTRa1-fhl6notQEUFGoTaKUsmpTLWmYFHhZpMJIWH2xFKCRS6FJExwbCjRkTFCpxqMWsxprONTLWi0gWayXpZuoiCtagEC0UwZTpsykjHGWpkqqWpqe_NV0FEhgaTv2pkkRZ5fJwFxJVZciRNXBdFCRon_65ydlQCg3z-29bfHttF8-SfuoJkRCHEXzanXUXs42POwvwPwQlS3 |
| 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=Simon%27s+congruence+pattern+matching&rft.jtitle=Theoretical+computer+science&rft.au=Kim%2C+Sungmin&rft.au=Ko%2C+Sang-Ki&rft.au=Han%2C+Yo-Sub&rft.date=2024-05-01&rft.pub=Elsevier+B.V&rft.issn=0304-3975&rft.eissn=1879-2294&rft.volume=994&rft_id=info:doi/10.1016%2Fj.tcs.2024.114478&rft.externalDocID=S0304397524000938 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0304-3975&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0304-3975&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0304-3975&client=summon |