{ "labelLang" : "hun", "responseDate" : "2024-03-28 14:04", "content" : { "otype" : "JournalArticle", "mtid" : 23446762, "status" : "APPROVED", "published" : true, "comment" : "N1 Funding Details: 228021, ERC, Fonds National de la Reserche Luxembourg\nN1 Funding Details: PBELP2-133367, NSF, National Science Foundation", "unhandledTickets" : 0, "oldTimestamp" : "2018-10-01T21:53:49.000+0000", "deleted" : false, "oldId" : 13446762, "lastRefresh" : "2023-07-09T16:14:03.228+0000", "lastModified" : "2023-07-09T16:11:32.313+0000", "created" : "2013-11-13T11:45:42.000+0000", "creator" : { "otype" : "Admin", "mtid" : 10015168, "link" : "/api/admin/10015168", "label" : "Szakonyi Erzsebet (RAMKI admin 4)", "familyName" : "Szakonyi", "givenName" : "Erzsebet", "published" : true, "oldId" : 10015168, "snippet" : true }, "lastDuplumOK" : "2019-02-10T16:28:42.330+0000", "lastDuplumSearch" : "2019-02-10T16:28:42.330+0000", "core" : false, "citation" : true, "publicationPending" : false, "type" : { "otype" : "PublicationType", "mtid" : 24, "link" : "/api/publicationtype/24", "label" : "Folyóiratcikk", "code" : 24, "otypeName" : "JournalArticle", "listPosition" : 1, "published" : true, "oldId" : 24, "snippet" : true }, "subType" : { "otype" : "SubType", "mtid" : 1268360, "link" : "/api/subtype/1268360", "label" : "Konferenciaközlemény (Folyóiratcikk)", "name" : "Konferenciaközlemény", "nameEng" : "Conference paper in journal", "docType" : { "otype" : "PublicationType", "mtid" : 24, "link" : "/api/publicationtype/24", "label" : "Folyóiratcikk", "code" : 24, "otypeName" : "JournalArticle", "listPosition" : 1, "published" : true, "oldId" : 24, "snippet" : true }, "listPosition" : 109, "published" : true, "oldId" : 1268360, "snippet" : true }, "category" : { "otype" : "Category", "mtid" : 1, "link" : "/api/category/1", "label" : "Tudományos", "published" : true, "oldId" : 1, "snippet" : true }, "languages" : [ { "otype" : "Language", "mtid" : 10002, "link" : "/api/language/10002", "label" : "Angol", "name" : "Angol", "nameEng" : "English", "published" : true, "oldId" : 2, "snippet" : true } ], "firstAuthor" : "Cheraghchi, M", "authorships" : [ { "otype" : "PersonAuthorship", "mtid" : 30697080, "link" : "/api/authorship/30697080", "label" : "Cheraghchi, M", "listPosition" : 1, "share" : 0.0, "first" : true, "last" : false, "familyName" : "Cheraghchi", "givenName" : "M", "authorTyped" : true, "editorTyped" : false, "otherTyped" : false, "type" : { "otype" : "AuthorshipType", "mtid" : 1, "link" : "/api/authorshiptype/1", "label" : "Szerző", "code" : 0, "published" : true, "oldId" : 0, "snippet" : true }, "published" : false, "oldId" : 47946394, "snippet" : true } ], "title" : "Improved constructions for non-adaptive threshold group testing", "identifiers" : [ { "otype" : "PublicationIdentifier", "mtid" : 6847900, "link" : "/api/publicationidentifier/6847900", "label" : "DOI: 10.1007/s00453-013-9754-7", "source" : { "otype" : "PlainSource", "mtid" : 6, "link" : "/api/publicationsource/6", "label" : "DOI", "type" : { "otype" : "PublicationSourceType", "mtid" : 10001, "link" : "/api/publicationsourcetype/10001", "label" : "DOI", "mayHaveOa" : true, "published" : true, "snippet" : true }, "name" : "DOI", "nameEng" : "DOI", "linkPattern" : "https://doi.org/@@@", "publiclyVisible" : true, "published" : true, "oldId" : 6, "snippet" : true }, "validState" : "NO", "idValue" : "10.1007/s00453-013-9754-7", "realUrl" : "https://doi.org/10.1007/s00453-013-9754-7", "published" : false, "oldId" : 4381496, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 6847899, "link" : "/api/publicationidentifier/6847899", "label" : "Scopus: 84882902235", "source" : { "otype" : "PlainSource", "mtid" : 3, "link" : "/api/publicationsource/3", "label" : "Scopus", "type" : { "otype" : "PublicationSourceType", "mtid" : 10003, "link" : "/api/publicationsourcetype/10003", "label" : "Indexelő adatbázis", "mayHaveOa" : false, "published" : true, "snippet" : true }, "name" : "Scopus", "linkPattern" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-@@@", "publiclyVisible" : true, "published" : true, "oldId" : 3, "snippet" : true }, "validState" : "NO", "idValue" : "84882902235", "realUrl" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84882902235", "published" : false, "oldId" : 4381495, "snippet" : true } ], "journal" : { "otype" : "Journal", "mtid" : 196, "link" : "/api/journal/196", "label" : "ALGORITHMICA 0178-4617 1432-0541", "pIssn" : "0178-4617", "eIssn" : "1432-0541", "reviewType" : "REVIEWED", "noIF" : false, "sciIndexed" : true, "scopusIndexed" : true, "lang" : "FOREIGN", "hungarian" : false, "published" : true, "oldId" : 196, "snippet" : true }, "volume" : "67", "issue" : "3", "firstPage" : "384", "lastPage" : "417", "firstPageOrInternalIdForSort" : "384", "pageLength" : 34, "publishedYear" : 2013, "digital" : null, "printed" : null, "sourceYear" : 2013, "packet" : "(Szakonyi Erzsebet (MATK admin); 2013.11.13. 12:44:36)", "foreignEdition" : true, "foreignLanguage" : true, "fullPublication" : true, "conferencePublication" : true, "nationalOrigin" : null, "missingAuthor" : false, "oaType" : "NONE", "oaCheckDate" : "2023-07-09", "oaFree" : false, "citationCount" : 0, "citationCountUnpublished" : 0, "citationCountWoOther" : 0, "independentCitCountWoOther" : 0, "doiCitationCount" : 0, "wosCitationCount" : 0, "scopusCitationCount" : 0, "independentCitationCount" : 0, "unhandledCitationCount" : 0, "citingPubCount" : 0, "independentCitingPubCount" : 0, "unhandledCitingPubCount" : 0, "citedPubCount" : 1, "citedCount" : 1, "referenceList" : "Ben-Aroya, A., Ta-Shma, A., Constructing small-bias sets from algebraic-geometric codes (2009) Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS); \n\nBlass, A., Gurevich, Y., Testing, P., (2002) Bull. Eur. Assoc. Theor. Comput. Sci., 78, pp. 100-132. , 1169.68352; \n\nBruno, W.J., Knill, E., Balding, D.J., Bruce, D.C., Doggett, N.A., Sawhill, W.W., Stallings, R.L., Torney, D.C., Efficient pooling designs for library screening (1995) Genomics, 26 (1), pp. 21-30. , 10.1016/0888-7543(95)80078-Z; \n\nCapalbo, M., Reingold, O., Vadhan, S., Wigderson, A., Randomness conductors and constant-degree expansion beyond the degree/2 barrier (2002) Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC), pp. 659-668; \n\nChen, H.-B., Fu, H.-L., Nonadaptive algorithms for threshold group testing (2009) Discrete Appl. Math., 157, pp. 1581-1585. , 2510237 1186.68436 10.1016/j.dam.2008.06.003; \n\nChen, H.-B., Du, D.-Z., Hwang, F.-K., An unexpected meeting of four seemingly unrelated problems: Graph testing, DNA complex screening, superimposed codes and secure key distribution (2007) J. Comb. Optim., 14 (2-3), pp. 121-129. , 2344838 1131.05055 10.1007/s10878-007-9067-3; \n\nChen, H.-B., Fu, H.-L., Hwang, F.-K., An upper bound of the number of tests in pooling designs for the error-tolerant complex model (2008) Optim. Lett., 2 (3), pp. 425-431. , 2399472 1144.92309 10.1007/s11590-007-0070-5; \n\nCheng, Y., Du, D.-Z., New constructions of one- and two-stage pooling designs (2008) J. Comput. Biol., 15 (2), pp. 195-205. , 2383629 10.1089/cmb.2007.0195; \n\nCheraghchi, M., Noise-resilient group testing: Limitations and constructions (2009) Proceedings of the 17th International Symposium on Fundamentals of Computation Theory (FCT), pp. 62-73. , Lecture Notes in Computer Science 5699 10.1007/978-3-642-03409-1-7; \n\nCheraghchi, M., (2010) Applications of Derandomization Theory in Coding, , http://eccc.hpi-web.de/static/books/ Applications_of_Derandomization_Theory_in_Coding/, Ph.D. Thesis, EPFL, Lausanne, Switzerland; \n\nCheraghchi, M., Improved constructions for non-adaptive threshold group testing (2010) Proceedings of the 37th International Colloquium on Automata, Languages and Programming (ICALP), , arXiv:1002.2244v3 [cs.DM]; \n\nClifford, R., Efremenko, K., Porat, E., Rothschild, A., K-mismatch with don't cares (2007) Proceedings of the 15th European Symposium on Algorithm (ESA), pp. 151-162. , Lecture Notes in Computer Science 4698; \n\nCormode, G., Muthukrishnan, S., What's hot and what's not: Tracking most frequent items dynamically (2005) ACM Trans. Database Syst., 30 (1), pp. 249-278. , 2132028 10.1145/1061318.1061325; \n\nCormode, G., Muthukrishnan, S., Combinatorial algorithms for compressed sensing (2006) Proceedings of Information Sciences and Systems, pp. 198-201; \n\nDamaschke, P., Threshold group testing (2006) General Theory of Information Transfer and Combinatorics, pp. 707-718. , Lecture Notes in Computer Science 4123 Springer Berlin 10.1007/11889342-45; \n\nDorfman, R., The detection of defective members of large populations (1943) Ann. Math. Stat., 14, pp. 436-440. , 10.1214/aoms/1177731363; \n\nDu, D.-Z., Hwang, F., (2000) Combinatorial Group Testing and Its Applications, , 2 World Scientific Singapore 0952.90001; \n\nDu, D.-Z., Hwang, F.-K., (2006) Pooling Designs and Nonadaptive Group Testing, , World Scientific Singapore 05070274; \n\nD'Yachkov, A.G., Rykov, V.V., Bounds of the length of disjunct codes (1982) Probl. Control Inf. Theory, 11, pp. 7-13. , 711896; \n\nD'Yachkov, A.G., Rykov, V.V., Rashad, A.M., Superimposed distance codes (1989) Probl. Control Inf. Theory, 18 (4), pp. 237-250. , 1017407; \n\nD'Yachkov, A.J., An Macula, A.G., Rykov, V.V., New applications and results of superimposed code theory arising from the potentialities of molecular biology (2000) Numbers, Information and Complexity, pp. 265-282. , 10.1007/978-1-4757-6048-4-22; \n\nD'Yachkov, A.J., An Macula, A.G., Rykov, V.V., New constructions of superimposed codes (2000) IEEE Trans. Inf. Theory, 46 (1), pp. 284-290. , 1743595 0999.94044 10.1109/18.817530; \n\nD'Yachkov, A., Vilenkin, P., Macula, A., Torney, D., Families of finite sets in which no intersection of ℓ sets is covered by the union of s others (2002) J. Comb. Theory, Ser. A, 99, pp. 195-218. , 1917018 1020.94027 10.1006/jcta.2002.3257; \n\nFarach, M., Kannan, S., Knill, E., Muthukrishnan, S., Group testing problems with sequences in experimental molecular biology (1997) Proceedings of Compression and Complexity of Sequences, pp. 357-367; \n\nGao, H., Hwang, F.K., Thai, M.T., Wu, W., Znati, T., Construction of d(H)-disjunct matrix for group testing in hypergraphs (2006) J. Comb. Optim., 12, pp. 297-301. , 2257676 1115.92019 10.1007/s10878-006-9634-z; \n\nGarcia, A., Stichtenoth, H., A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vlǎduţ bound (1995) Invent. Math., 121, pp. 211-222. , 1345289 0822.11078 10.1007/BF01884295; \n\nGuruswami, V., Umans, C., Vadhan, S., Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes (2007) Proceedings of the 22nd IEEE Conference on Computational Complexity (CCC); \n\nHong, E.-S., Ladner, R.E., Group testing for image compression (2000) Data Compression Conference, pp. 3-12; \n\nKautz, W.H., Singleton, R.C., Nonrandom binary superimposed codes (1964) IEEE Trans. Inf. Theory, 10, pp. 363-377. , 0133.12402 10.1109/TIT.1964.1053689; \n\nKim, H.K., Lebedev, V., On optimal superimposed codes (2004) J. Comb. Des., 12, pp. 79-91. , 2036646 1051.94013 10.1002/jcd.10056; \n\nMacula, A.J., Probabilistic nonadaptive group testing in the presence of errors and DNA library screening (1999) Ann. Comb., 3 (1), pp. 61-69. , 1769693 1063.62599 10.1007/BF01609876; \n\nMacwilliams, F.J., Sloane, N.J., (1977) The Theory of Error-Correcting Codes, , North Holand Amsterdam 0369.94008; \n\nNgo, H.-Q., Du, D.-Z., A survey on combinatorial group testing algorithms with applications to DNA library screening (2000) DIMACS Series on Discrete Math. And Theoretical Computer Science, pp. 171-182. , 55; \n\nPorat, E., Rothschild, A., Explicit non-adaptive combinatorial group testing schemes (2008) Proceedings of the 35th International Colloquium on Automata, Languages and Programming (ICALP), pp. 748-759. , Lecture Notes in Computer Science 5125 10.1007/978-3-540-70575-8-61; \n\nRadhakrishan, J., Ta-Shma, A., Tight bounds for depth-two superconcentrators (1997) Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 585-594. , 10.1109/SFCS.1997.646148; \n\nRoth, R.M., (2006) Introduction to Coding Theory, , Cambridge University Press Cambridge 1092.94001 10.1017/CBO9780511808968; \n\nRuszinkó, On the upper bound of the size of the r-cover-free families (1994) J. Comb. Theory, Ser. A, 66, pp. 302-310. , 0798.05071 10.1016/0097-3165(94)90067-1; \n\nSchliep, A., Torney, D., Rahmann, S., Group testing with DNA chips: Generating designs and decoding experiments (2003) Proceedings of Computational Systems Bioinformatics; \n\nStinson, D.R., Wei, R., Generalized cover-free families (2004) Discrete Math., 279, pp. 463-477. , 2060007 1034.05047 10.1016/S0012-365X(03)00287-5; \n\nStinson, D.R., Wei, R., Zhu, L., Some new bounds for cover-free families (2000) J. Comb. Theory, Ser. A, 90, pp. 224-234. , 1749434 0948.05055 10.1006/jcta.1999.3036; \n\nTsfasman, M.A., Vlǎduţ, S.G., Zink, Th., Modular curves, Shimura curves, and Goppa codes better than the Varshamov-Gilbert bound (1982) Math. Nachr., 109, pp. 21-28. , 705893 0574.94013 10.1002/mana.19821090103; \n\nVan Lint, J.H., (1998) Introduction to Coding Theory, p. 86. , 3 Graduate Texts in Mathematics Springer Berlin; \n\nWolf, J., Born-again group testing: Multiaccess communications (1985) IEEE Trans. Inf. Theory, 31, pp. 185-191. , 0586.94011 10.1109/TIT.1985.1057026; \n\nWu, W., Huang, Y., Huang, X., Li, Y., On error-tolerant DNA screening (2006) Discrete Appl. Math., 154 (12), pp. 1753-1758. , 2233293 1095.92042 10.1016/j.dam.2006.02.006; \n\nWu, W., Li, Y., Huang, C.H., Du, D.Z., Molecular biology and pooling design (2008) Data Min. Biomed., 7, pp. 133-139. , 10.1007/978-0-387-69319-4-8", "hasCitationDuplums" : false, "userChangeableUntil" : "2013-11-13T12:03:27.000+0000", "publishDate" : "2013-11-13T12:03:22.000+0000", "directInstitutesForSort" : "", "ownerAuthorCount" : 1, "ownerInstituteCount" : 15, "directInstituteCount" : 0, "authorCount" : 1, "contributorCount" : 0, "hasQualityFactor" : false, "link" : "/api/publication/23446762", "label" : "Cheraghchi M. Improved constructions for non-adaptive threshold group testing. (2013) ALGORITHMICA 0178-4617 1432-0541 67 3 384-417", "template" : "