Indeterminate string inference algorithms
Regularities in indeterminate strings have recently been a matter of interest because of their use in the fields of molecular biology, musical text analysis, cryptanalysis and so on. In this paper, we study the problem of reconstructing an indeterminate string from a border array. We present two eff...
Saved in:
| Published in | Journal of discrete algorithms (Amsterdam, Netherlands) Vol. 10; pp. 23 - 34 |
|---|---|
| Main Authors | , , |
| Format | Journal Article |
| Language | English |
| Published |
Elsevier B.V
2012
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 1570-8667 1570-8675 |
| DOI | 10.1016/j.jda.2011.08.002 |
Cover
| Abstract | Regularities in indeterminate strings have recently been a matter of interest because of their use in the fields of molecular biology, musical text analysis, cryptanalysis and so on. In this paper, we study the problem of reconstructing an indeterminate string from a border array. We present two efficient algorithms to reconstruct an indeterminate string from a valid border array – one using an unbounded alphabet and the other using minimum sized alphabet. We also propose an
O
(
n
2
)
algorithm for reconstructing an indeterminate string from suffix array and LCP array. |
|---|---|
| AbstractList | Regularities in indeterminate strings have recently been a matter of interest because of their use in the fields of molecular biology, musical text analysis, cryptanalysis and so on. In this paper, we study the problem of reconstructing an indeterminate string from a border array. We present two efficient algorithms to reconstruct an indeterminate string from a valid border array – one using an unbounded alphabet and the other using minimum sized alphabet. We also propose an
O
(
n
2
)
algorithm for reconstructing an indeterminate string from suffix array and LCP array. |
| Author | Reaz, Rezwana Rahman, M. Sohel Nazeen, Sumaiya |
| Author_xml | – sequence: 1 givenname: Sumaiya surname: Nazeen fullname: Nazeen, Sumaiya email: nazeen@cse.buet.ac.bd – sequence: 2 givenname: M. Sohel surname: Rahman fullname: Rahman, M. Sohel email: msrahman@cse.buet.ac.bd – sequence: 3 givenname: Rezwana surname: Reaz fullname: Reaz, Rezwana email: rimpi@cse.buet.ac.bd |
| BookMark | eNp9z0FLwzAUwPEgE9ymH8Dbrh5a85KmafEkQ-dg4EXPIUteZkqbShIEv70dEw8ednrv8P4PfgsyC2NAQm6BlkChvu_KzuqSUYCSNiWl7ILMQUhaNLUUs7-9lldkkVI3HQio2JzcbYPFjHHwQWdcpRx9OKx8cBgxGFzp_jBGnz-GdE0une4T3vzOJXl_fnpbvxS71812_bgrDGtlLrTkrHY131veVpoaKY3glFWtZg5k7QxIwH3lbIvUTHfCciFbLTi0nFkUfEnk6a-JY0oRnTI-6-zHkKP2vQKqjmLVqUmsjmJFGzWBphL-lZ_RDzp-n20eTg1OpC-PUSXjj3LrI5qs7OjP1D_FBG_F |
| CitedBy_id | crossref_primary_10_1142_S1793830913600057 crossref_primary_10_1016_j_jda_2014_12_006 crossref_primary_10_1016_j_dam_2015_05_019 crossref_primary_10_1016_j_tcs_2020_12_007 |
| Cites_doi | 10.1016/S0304-3975(00)00407-2 10.1137/0216067 10.1007/978-3-540-76336-9_30 10.1142/S0129054109007005 10.1016/j.jda.2006.10.003 10.1007/978-3-642-13509-5_23 10.1007/978-3-642-13509-5_22 10.1007/s11786-007-0029-z 10.1137/S0097539700382704 10.1007/978-3-642-00982-2_36 |
| ContentType | Journal Article |
| Copyright | 2011 Elsevier B.V. |
| Copyright_xml | – notice: 2011 Elsevier B.V. |
| DBID | 6I. AAFTH AAYXX CITATION |
| DOI | 10.1016/j.jda.2011.08.002 |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1570-8675 |
| EndPage | 34 |
| ExternalDocumentID | 10_1016_j_jda_2011_08_002 S1570866711000761 |
| GroupedDBID | --K --M .~1 0R~ 1B1 1~. 1~5 29K 4.4 457 4G. 5GY 5VS 6I. 7-5 71M 8P~ AACTN AAEDT AAEDW AAFTH AAIKJ AAKOC AALRI AAOAW AAQFI AAXUO AAYFN ABAOU ABBOA ABJNI ABMAC ABVKL ABXDB ABYKQ ACAZW ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADMUD AEBSH AEKER AEXQZ AFKWA AFTJW AGHFR AGUBO AGYEJ AIALX AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ARUGR AXJTR BKOJK BLXMC CS3 D-I DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 FDB FEDTE FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HVGLF HZ~ IHE IXB J1W KOM M41 MHUIS MO0 N9A NCXOZ O-L O9- OAUVE OK1 OZT P-8 P-9 PC. Q38 RIG ROL RPZ SDF SDG SES SEW SPC SSV SSW SSZ T5K ~G- AATTM AAXKI AAYWO AAYXX ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO ADVLN AEIPS AEUPX AFPUW AIGII AIIUN AKBMS AKRWK AKYEP ANKPU CITATION EFKBS ~HD |
| ID | FETCH-LOGICAL-c297t-a7326f63bd394a0c77c530249a2f176fc171eb4fd9e0cf635d3579a531932de53 |
| IEDL.DBID | .~1 |
| ISSN | 1570-8667 |
| IngestDate | Wed Oct 01 03:19:22 EDT 2025 Thu Apr 24 23:04:51 EDT 2025 Fri Feb 23 02:29:58 EST 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | false |
| IsScholarly | true |
| Keywords | LCP array Suffix array Indeterminate string inference Border array |
| Language | English |
| License | http://www.elsevier.com/open-access/userlicense/1.0 https://www.elsevier.com/tdm/userlicense/1.0 https://www.elsevier.com/open-access/userlicense/1.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c297t-a7326f63bd394a0c77c530249a2f176fc171eb4fd9e0cf635d3579a531932de53 |
| OpenAccessLink | https://www.sciencedirect.com/science/article/pii/S1570866711000761 |
| PageCount | 12 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_jda_2011_08_002 crossref_primary_10_1016_j_jda_2011_08_002 elsevier_sciencedirect_doi_10_1016_j_jda_2011_08_002 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2012 2012-01-00 |
| PublicationDateYYYYMMDD | 2012-01-01 |
| PublicationDate_xml | – year: 2012 text: 2012 |
| PublicationDecade | 2010 |
| PublicationTitle | Journal of discrete algorithms (Amsterdam, Netherlands) |
| PublicationYear | 2012 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | R. Cole, R. Hariharan, P. Indyk, Tree pattern matching and subset matching in deterministic M. Crochemore, C.S. Iliopoulos, S.P. Pissis, G. Tischler, Cover array string reconstruction, in: CPM, 2010, pp. 251–259. Blanchet-Sadri, Hegstrom (br0060) 2002; 270 Antoniou, Iliopoulos, Jayasekera, Rytter (br0030) 2008 Duval, Lecroq, Lefebvre (br0110) 2005; 10 Franěk, Lu, Ryan, Smyth, Sun, Yang (br0130) 2002; 42 Bannai, Inenaga, Shinohara, Takeda (br0040) 2003; vol. 2747 Abrahamson (br0010) 1987; 16 Antoniou, Crochemore, Ilipoulos, Jayasekera, Landau (br0020) 2008 Cole, Hariharan (br0070) 2003; 32 time, in: SODA, 1999, pp. 245–254. Iliopoulos, Mouchard, Rahman (br0190) 2008; 1 C.S. Iliopoulos, M.S. Rahman, M. Vorácek, L. Vagner, The constrained longest common subsequence problem for degenerate strings, in: CIAA, 2007, pp. 309–311. J. Holub, W.F. Smyth, Algorithms on indeterminate strings, in: Proceedings of the 14th Australian Workshop on Combinatorial Algorithms, 2003, pp. 36–45. M.J. Fischer, M.S. Paterson, String-matching and other products, Technical Report, Massachusetts Institute of Technology, Cambridge, MA, USA, 1974. Smyth, Wang (br0210) 2008; vol. 5280 Bari, Rahman, Shahriar (br0050) 2009 Iliopoulos, Mohamed, Mouchard, Perdikuri, Smyth, Tsakalidis (br0180) 2003; 10 Duval, Lefebvre (br0100) 2002; 36 T. I, S. Inenaga, H. Bannai, M. Takeda, Counting parameterized border arrays for a binary alphabet, in: LATA, 2009, pp. 422–433. Smyth, Wang (br0220) 2009; 20 Holub, Smyth, Wang (br0150) 2008; 6 T. I, S. Inenaga, H. Bannai, M. Takeda, Verifying a parameterized border array in time, in: CPM, 2010, pp. 238–250. Cole (10.1016/j.jda.2011.08.002_br0070) 2003; 32 10.1016/j.jda.2011.08.002_br0120 Blanchet-Sadri (10.1016/j.jda.2011.08.002_br0060) 2002; 270 Duval (10.1016/j.jda.2011.08.002_br0100) 2002; 36 Bari (10.1016/j.jda.2011.08.002_br0050) 2009 Antoniou (10.1016/j.jda.2011.08.002_br0020) 2008 Antoniou (10.1016/j.jda.2011.08.002_br0030) 2008 10.1016/j.jda.2011.08.002_br0200 10.1016/j.jda.2011.08.002_br0080 Smyth (10.1016/j.jda.2011.08.002_br0220) 2009; 20 10.1016/j.jda.2011.08.002_br0090 10.1016/j.jda.2011.08.002_br0140 10.1016/j.jda.2011.08.002_br0160 10.1016/j.jda.2011.08.002_br0170 Smyth (10.1016/j.jda.2011.08.002_br0210) 2008; vol. 5280 Holub (10.1016/j.jda.2011.08.002_br0150) 2008; 6 Iliopoulos (10.1016/j.jda.2011.08.002_br0190) 2008; 1 Iliopoulos (10.1016/j.jda.2011.08.002_br0180) 2003; 10 Franěk (10.1016/j.jda.2011.08.002_br0130) 2002; 42 Abrahamson (10.1016/j.jda.2011.08.002_br0010) 1987; 16 Duval (10.1016/j.jda.2011.08.002_br0110) 2005; 10 Bannai (10.1016/j.jda.2011.08.002_br0040) 2003; vol. 2747 |
| References_xml | – reference: C.S. Iliopoulos, M.S. Rahman, M. Vorácek, L. Vagner, The constrained longest common subsequence problem for degenerate strings, in: CIAA, 2007, pp. 309–311. – volume: 10 start-page: 40 year: 2003 end-page: 51 ident: br0180 article-title: String regularities with donʼt cares publication-title: Nordic J. Comput. – volume: 42 start-page: 223 year: 2002 end-page: 236 ident: br0130 article-title: Verifying a border array in linear time publication-title: J. Combin. Math. Combin. Comput. – volume: 6 start-page: 37 year: 2008 end-page: 50 ident: br0150 article-title: Fast pattern-matching on indeterminate strings publication-title: J. Discrete Algorithms – reference: time, in: CPM, 2010, pp. 238–250. – volume: 36 start-page: 249 year: 2002 end-page: 259 ident: br0100 article-title: Words over an ordered alphabet and suffix permutations publication-title: ITA – start-page: 108 year: 2008 end-page: 115 ident: br0020 article-title: Conservative string covering of indeterminate strings publication-title: Proceedings of the Prague Stringology Conference – reference: M.J. Fischer, M.S. Paterson, String-matching and other products, Technical Report, Massachusetts Institute of Technology, Cambridge, MA, USA, 1974. – volume: vol. 2747 start-page: 208 year: 2003 end-page: 217 ident: br0040 article-title: Inferring strings from graphs and arrays publication-title: Proceedings of the 28th International Symposium on Mathematical Foundations of Computer Science – reference: M. Crochemore, C.S. Iliopoulos, S.P. Pissis, G. Tischler, Cover array string reconstruction, in: CPM, 2010, pp. 251–259. – start-page: 108 year: 2008 end-page: 115 ident: br0030 article-title: Computing repetitive structures in indeterminate strings publication-title: Proceedings of the 3rd IAPR International Conference on Pattern Recognition in Bioinformatics – reference: -time, in: SODA, 1999, pp. 245–254. – reference: T. I, S. Inenaga, H. Bannai, M. Takeda, Counting parameterized border arrays for a binary alphabet, in: LATA, 2009, pp. 422–433. – volume: 20 start-page: 985 year: 2009 end-page: 1004 ident: br0220 article-title: An adaptive hybrid pattern-matching algorithm on indeterminate strings publication-title: Internat. J. Found. Comput. Sci. – volume: 10 start-page: 51 year: 2005 end-page: 60 ident: br0110 article-title: Border array on bounded alphabet publication-title: J. Autom. Lang. Comb. – volume: 16 start-page: 1039 year: 1987 end-page: 1051 ident: br0010 article-title: Generalized string matching publication-title: SIAM J. Comput. – volume: 270 start-page: 401 year: 2002 end-page: 419 ident: br0060 article-title: Partial words and a theorem of Fine and Wilf revisited publication-title: Theoret. Comput. Sci. – volume: 32 start-page: 1056 year: 2003 end-page: 1066 ident: br0070 article-title: Tree pattern matching to subset matching in linear time publication-title: SIAM J. Comput. – reference: J. Holub, W.F. Smyth, Algorithms on indeterminate strings, in: Proceedings of the 14th Australian Workshop on Combinatorial Algorithms, 2003, pp. 36–45. – volume: 1 start-page: 557 year: 2008 end-page: 569 ident: br0190 article-title: A new approach to pattern matching in degenerate DNA/RNA sequences and distributed pattern matching publication-title: Math. Comput. Sci. – start-page: 263 year: 2009 end-page: 271 ident: br0050 article-title: Finding all covers of an indeterminate string in publication-title: Proceedings of the Prague Stringology Conference – reference: T. I, S. Inenaga, H. Bannai, M. Takeda, Verifying a parameterized border array in – reference: R. Cole, R. Hariharan, P. Indyk, Tree pattern matching and subset matching in deterministic – volume: vol. 5280 start-page: 133 year: 2008 end-page: 143 ident: br0210 article-title: New perspectives on the prefix array publication-title: Proceedings of the 15th SPIRE – volume: 270 start-page: 401 year: 2002 ident: 10.1016/j.jda.2011.08.002_br0060 article-title: Partial words and a theorem of Fine and Wilf revisited publication-title: Theoret. Comput. Sci. doi: 10.1016/S0304-3975(00)00407-2 – start-page: 108 year: 2008 ident: 10.1016/j.jda.2011.08.002_br0020 article-title: Conservative string covering of indeterminate strings – volume: 16 start-page: 1039 year: 1987 ident: 10.1016/j.jda.2011.08.002_br0010 article-title: Generalized string matching publication-title: SIAM J. Comput. doi: 10.1137/0216067 – volume: 42 start-page: 223 year: 2002 ident: 10.1016/j.jda.2011.08.002_br0130 article-title: Verifying a border array in linear time publication-title: J. Combin. Math. Combin. Comput. – volume: 10 start-page: 40 year: 2003 ident: 10.1016/j.jda.2011.08.002_br0180 article-title: String regularities with donʼt cares publication-title: Nordic J. Comput. – start-page: 263 year: 2009 ident: 10.1016/j.jda.2011.08.002_br0050 article-title: Finding all covers of an indeterminate string in O(n) time on average – ident: 10.1016/j.jda.2011.08.002_br0200 doi: 10.1007/978-3-540-76336-9_30 – volume: 20 start-page: 985 year: 2009 ident: 10.1016/j.jda.2011.08.002_br0220 article-title: An adaptive hybrid pattern-matching algorithm on indeterminate strings publication-title: Internat. J. Found. Comput. Sci. doi: 10.1142/S0129054109007005 – volume: vol. 2747 start-page: 208 year: 2003 ident: 10.1016/j.jda.2011.08.002_br0040 article-title: Inferring strings from graphs and arrays – volume: 6 start-page: 37 year: 2008 ident: 10.1016/j.jda.2011.08.002_br0150 article-title: Fast pattern-matching on indeterminate strings publication-title: J. Discrete Algorithms doi: 10.1016/j.jda.2006.10.003 – ident: 10.1016/j.jda.2011.08.002_br0090 doi: 10.1007/978-3-642-13509-5_23 – volume: 36 start-page: 249 year: 2002 ident: 10.1016/j.jda.2011.08.002_br0100 article-title: Words over an ordered alphabet and suffix permutations publication-title: ITA – ident: 10.1016/j.jda.2011.08.002_br0170 doi: 10.1007/978-3-642-13509-5_22 – start-page: 108 year: 2008 ident: 10.1016/j.jda.2011.08.002_br0030 article-title: Computing repetitive structures in indeterminate strings – volume: 1 start-page: 557 year: 2008 ident: 10.1016/j.jda.2011.08.002_br0190 article-title: A new approach to pattern matching in degenerate DNA/RNA sequences and distributed pattern matching publication-title: Math. Comput. Sci. doi: 10.1007/s11786-007-0029-z – ident: 10.1016/j.jda.2011.08.002_br0080 – volume: 32 start-page: 1056 year: 2003 ident: 10.1016/j.jda.2011.08.002_br0070 article-title: Tree pattern matching to subset matching in linear time publication-title: SIAM J. Comput. doi: 10.1137/S0097539700382704 – ident: 10.1016/j.jda.2011.08.002_br0120 – ident: 10.1016/j.jda.2011.08.002_br0160 doi: 10.1007/978-3-642-00982-2_36 – volume: vol. 5280 start-page: 133 year: 2008 ident: 10.1016/j.jda.2011.08.002_br0210 article-title: New perspectives on the prefix array – ident: 10.1016/j.jda.2011.08.002_br0140 – volume: 10 start-page: 51 year: 2005 ident: 10.1016/j.jda.2011.08.002_br0110 article-title: Border array on bounded alphabet publication-title: J. Autom. Lang. Comb. |
| SSID | ssj0025142 |
| Score | 1.9061338 |
| Snippet | Regularities in indeterminate strings have recently been a matter of interest because of their use in the fields of molecular biology, musical text analysis,... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 23 |
| SubjectTerms | Border array Indeterminate string inference LCP array Suffix array |
| Title | Indeterminate string inference algorithms |
| URI | https://dx.doi.org/10.1016/j.jda.2011.08.002 |
| Volume | 10 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Baden-Württemberg Complete Freedom Collection (Elsevier) customDbUrl: eissn: 1570-8675 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0025142 issn: 1570-8667 databaseCode: GBLVA dateStart: 20110101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVESC databaseName: Elsevier Free Content customDbUrl: eissn: 1570-8675 dateEnd: 20211102 omitProxy: true ssIdentifier: ssj0025142 issn: 1570-8667 databaseCode: IXB dateStart: 20030201 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVESC databaseName: Elsevier Science Direct Complete Freedom Collection customDbUrl: eissn: 1570-8675 dateEnd: 20180930 omitProxy: true ssIdentifier: ssj0025142 issn: 1570-8667 databaseCode: ACRLP dateStart: 20030201 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals [SCFCJ] customDbUrl: eissn: 1570-8675 dateEnd: 20180930 omitProxy: true ssIdentifier: ssj0025142 issn: 1570-8667 databaseCode: AIKHN dateStart: 20030201 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVESC databaseName: ScienceDirect (Elsevier) customDbUrl: eissn: 1570-8675 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0025142 issn: 1570-8667 databaseCode: .~1 dateStart: 20030201 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVLSH databaseName: Elsevier Journals customDbUrl: mediaType: online eissn: 1570-8675 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0025142 issn: 1570-8667 databaseCode: AKRWK dateStart: 20030201 isFulltext: true providerName: Library Specific Holdings |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV07T8MwELYqWFh4I8qjysACkmkejl2PpaJqQXSBSt0iP5KSqqRVCSu_HV9iFxCCgdHWnRRfci_n7j6ELqRggaCSYF_rGBMVSyx1yrCkAJsmjGpW7WIPIzoYk7tJPGmgnuuFgbJKa_trm15Za7vTttJsL_O8_RjEzMTjlMHQM8jGoYOdMEAxuH5fl3kY910B6AAxBmr3Z7Oq8Zpp8TnF096s_PBNX_xNfxdt20DR69bPsocaabGPdhwIg2d18gBdDgvtSlrK1AMYjmLq5a6PzxPz6WKVl88vr4do3L996g2wxT_AKuSsxIKZ2CqjkdQRJ8JXjCnA-CFchFnAaKYCFqSSZJqnvjJ0sY5ixgVoVRTqNI6O0EaxKNJj5DFo1uhEQQYZFJVaKhppyqlJ1jo84LqJfHfyRNnh4IBRMU9cFdgsMcJKQFgJ4Fb6YRNdrVmW9WSMv4iJE2fy7fUmxnL_znbyP7ZTtGVWYX1TcoY2ytVbem5ih1K2qo-jhTa7w_vByKyGk5sPLwrBcw |
| linkProvider | Elsevier |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV07T8MwELZKGWDhjSjPDCwgmebhRz2iiqqFtgut1M2yYwdSlbQqYeW3YydOASEYWOM7ybnkXvbdfQBcSkEDQSSCvlIYohhLKJWmUBILmyaMahbtYoMh6Y7R_QRPaqBd9cLYskpn-0ubXlhr96TppNlcpGnzMcDUxOOE2qFnNhtfA-sIh9RmYDfvqzoP478LBB1LDS15dbVZFHlNlfgc4-mOVn44py8Op7MDtlyk6N2Wm9kFNZ3tge0KhcFzSrkPrnqZqmpacu1ZHI7syUurRj5PzJ7myzR_fnk9AOPO3ajdhQ4AAcYhozkU1ARXCYmkihgSfkxpbEF-EBNhElCSxAENtESJYtqPDR1WEaZMWLWKQqVxdAjq2TzTR8CjtlujFQWJTaGIVDImkSKMmGytxQKmGsCv3pzHbjq4BamY8aoMbMqNsLgVFrfAlX7YANcrlkU5GuMvYlSJk3_7vtyY7t_Zjv_HdgE2uqNBn_d7w4cTsGlWwvLY5BTU8-WbPjOBRC7Pix_lA2IgwgQ |
| 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=Indeterminate+string+inference+algorithms&rft.jtitle=Journal+of+discrete+algorithms+%28Amsterdam%2C+Netherlands%29&rft.au=Nazeen%2C+Sumaiya&rft.au=Rahman%2C+M.+Sohel&rft.au=Reaz%2C+Rezwana&rft.date=2012&rft.pub=Elsevier+B.V&rft.issn=1570-8667&rft.eissn=1570-8675&rft.volume=10&rft.spage=23&rft.epage=34&rft_id=info:doi/10.1016%2Fj.jda.2011.08.002&rft.externalDocID=S1570866711000761 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1570-8667&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1570-8667&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1570-8667&client=summon |