{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T01:53:53Z","timestamp":1648950833459},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,7,1]],"date-time":"2012-07-01T00:00:00Z","timestamp":1341100800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Comput. Sci. Technol."],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1007\/s11390-012-1261-9","type":"journal-article","created":{"date-parts":[[2012,7,13]],"date-time":"2012-07-13T08:31:36Z","timestamp":1342168296000},"page":"897-902","source":"Crossref","is-referenced-by-count":1,"title":["Some Indices of Alphabet Overlap Graph"],"prefix":"10.1007","volume":"27","author":[{"given":"Rong","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhao-Lan","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"He-Ping","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,7,12]]},"reference":[{"key":"1261_CR1","unstructured":"Diestel R. Graph Theory (2nd edition), Springer-Verlag, 2000."},{"key":"1261_CR2","unstructured":"Godbole A, Knisley D, Norwood R. Some properties of alphabet overlap graphs, http:\/\/arxiv.org\/abs\/math\/0510094 ."},{"key":"1261_CR3","doi-asserted-by":"crossref","unstructured":"Patwardhan R, Tang H, Kim S, Dalkilie M. An approximate de Bruijn graph approach to multiple local alignment and mitif discovery on protein sequences. In Proc. the 1st International Conference on Data Mining and Bioinformatics, Sept. 2006, pp.158\u2013169.","DOI":"10.1007\/11960669_14"},{"key":"1261_CR4","doi-asserted-by":"crossref","unstructured":"Lin H. 1-Fair alternator designs for the de Bruijn network [Master\u2019s Thesis]. National Sun Yat-sen University, 2006.","DOI":"10.1109\/PDCAT.2006.118"},{"issue":"1","key":"1261_CR5","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/s11390-011-9421-x","volume":"26","author":"S Abed","year":"2011","unstructured":"Abed S, Mokhtari Y, Ait-Mohamed O, Tahar S. NuMDG: A new tool for multiway decision graphs construction. Journal of Computer Science and Technology, Jan. 2011, 26(1): 139\u2013152.","journal-title":"Journal of Computer Science and Technology"},{"key":"1261_CR6","first-page":"3","volume":"73","author":"K Debra","year":"2010","unstructured":"Debra K, Yared N, Attila P. On the chromatic number of \u03b1-overlap graphs. Journal of Combinatorial Mathematics and Computational Computing, 2010, 73: 3\u201313.","journal-title":"Journal of Combinatorial Mathematics and Computational Computing"},{"issue":"1\/2","key":"1261_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0166-218X(99)00109-2","volume":"98","author":"J Blasewicz","year":"1999","unstructured":"Blasewicz J, Hertz A, Kobler D, de Werra D. On some properties of DNA graphs. Discrete Appl. Math., 1999, 98(1\/2): 1\u201319.","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"1261_CR8","first-page":"479","volume":"56","author":"S Wang","year":"2006","unstructured":"Wang S, Yuan J. DNA computing of directed line-graphs. Communications Mathematical and in Computer Chemistry, 2006, 56(3): 479\u2013484.","journal-title":"Communications Mathematical and in Computer Chemistry"},{"issue":"1","key":"1261_CR9","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/s10910-009-9530-8","volume":"47","author":"XY Li","year":"2010","unstructured":"Li X Y, Zhang H P. Embedding on alphabet overlap digraphs. J. Math. Chem., 2010, 47(1): 62\u201371.","journal-title":"J. Math. Chem."},{"issue":"1","key":"1261_CR10","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/S0097-3165(03)00123-7","volume":"104","author":"E Rivals","year":"2003","unstructured":"Rivals E, Rahmann S. Combinatorics of periods in strings. J. Combin. Theory, Series A, 2003, 104(1): 95\u2013113.","journal-title":"J. Combin. Theory, Series A"},{"issue":"1","key":"1261_CR11","first-page":"29","volume":"25","author":"CH Liu","year":"2002","unstructured":"Liu C H, Zhang K M. Super connectivity and restricted connectivity of undirected de Bruijn graph. Acta Mathematicae Applicatae Sinica., 2002, 25(1): 29\u201335.","journal-title":"Acta Mathematicae Applicatae Sinica."}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-012-1261-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11390-012-1261-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-012-1261-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,30]],"date-time":"2019-06-30T21:38:07Z","timestamp":1561930687000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11390-012-1261-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7]]},"references-count":11,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,7]]}},"alternative-id":["1261"],"URL":"https:\/\/doi.org\/10.1007\/s11390-012-1261-9","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,7]]}}}