METHOD FOR DETERMINING NON-HOMOLOGOUS END JOINING REPAIR ACTIVITY
PCT/CN2015/087321
[LIU, Fenju 刘芬菊, LIU, Fenju 刘芬菊, DU, Jie 杜杰, LIU, Fenju 刘芬菊, DU, Jie 杜杰, YU, Jiahua 俞家华, LIU, Fenju 刘芬菊, DU, Jie 杜杰, YU, Jiahua 俞家华, ZHANG, Haowen 张昊文, LIU, Fenju 刘芬菊, DU, Jie 杜杰, YU, Jiahua 俞家华, ZHANG, Haowen 张昊文, SHANG, Zengfu 尚增甫, LIU, Fenju 刘芬菊, DU, Jie 杜杰, YU, Jiahua 俞家华, ZHANG, Haowen 张昊文, SHANG, Zengfu 尚增甫, ZHANG, Yushuo 张钰烁]
10#,Changjing Road Zhangjiagang 中国江苏省苏州市张家港市长泾路10号, Jiangsu 215600Suzhou, Jiangsu 215600
Provided is a method for determining non-homologous end joining repair activity, In the method, an HPRT gene is mutated by using a gene site-directed mutagenesis technique, then, the steps of plasmid transfection, drug treatment and 6-TG treatment need to be performed, and finally, the NHEJ repair activity is observed by means of cell activity detection.
更多详情内容请
点击查看
Performing map iterations in blockchain-based system
AU2019378667A
[HE JIAHUA, YU BENQUAN]
CN
(12) INTERNATIONAL APPLICATION PUBLISHED UNDER THE PATENT COOPERATION TREATY (PCT) (19) World Intellectual Property (1) Organization11111111111111111111111I111111111111li1111iiiiii International Bureau (10) International Publication Number (43) International Publication Date W O 2020/098820 A3 22 May 2020 (22.05.2020) W IPO I PCT (51) InternationalPatent Classification: (81) Designated States (unless otherwise indicated, for every G06F16/22 (2019.01) kind ofnational protection available): AE, AG, AL, AM, (21) International Application Number: AO, AT, AU, AZ, BA, BB, BG, BH, BN, BR, BW, BY, BZ, PCT/CN2019/123251 CA, CH, CL, CN, CO, CR, CU, CZ, DE, DJ, DK, DM, DO, DZ, EC, EE, EG, ES, Fl, GB, GD, GE, GH, GM, GT, HN, (22) International Filing Date: HR, HU, ID, IL, IN, IR, IS, JO, JP, KE, KG, KH, KN, KP, 05 December 2019 (05.12.2019) KR, KW, KZ, LA, LC, LK, LR, LS, LU, LY, MA, MD, ME, MG, MK, MN, MW, MX, MY, MZ, NA, NG, NI, NO, NZ, (25)FilingLanguage: English OM, PA, PE, PG, PH, PL, PT, QA, RO, RS, RU, RW, SA, (26) Publication Language: English SC, SD, SE, SG, SK, SL, SM, ST, SV, SY, TH, TJ, TM, TN, (71) Applicant: ALIPAY (HANGZHOU) INFORMATION TR, TT, TZ, UA, UG, US, UZ, VC, VN, ZA, ZM, ZW. TECHNOLOGY CO., LTD. [CN/CN]; No. 556 Xixi (84) Designated States (unless otherwise indicated, for every Road, 8th Floor, Section B, Suite 801-11, West Lake Dis- kind of regional protection available): ARIPO (BW, GH, trict, Hangzhou, Zhejiang 310000 (CN). GM, KE, LR, LS, MW, MZ, NA, RW, SD, SL, ST, SZ, TZ, UG, ZM, ZW), Eurasian (AM, AZ, BY, KG, KZ, RU, TJ, (72) Inventors: HE, Jiahua; No. 556 Xixi Road, 8thFloor, Sec- TM), European(AL,AT, BE,BG, CH, CY, CZ, DE, DK, tion B, Suite 801-11, West Lake District, Hangzhou, Zhe- EE,ES, FFR, GB,GR, HR, HU, IIS, IT, LT, LU, LV, jiang 310000 (CN). YU, Benquan; No. 556 Xixi Road, MC, MK, MT, NL, NO, PL, PT,RO, RS, SE,SI, SK, SM, 8th Floor, Section B, Suite 801-11, West Lake District, TR), OAPI (BF, BJ, CF,CG, CI, CM, GA, GN, GQ, GW, Hangzhou,Zhejiang310000(CN). KM, ML, MR, NE, SN, TD, TG). (74) Agent: BEIJING BESTIPR INTELLECTUAL PROP ERTY LAW CORPORATION; Room 409, Tower B, Ka Wah Building, No. 9 Shangdi 3rd Street, Haidian District, Beijing 100085 (CN). (54) Title: PERFORMING MAP ITERATIONS IN BLOCKCHAIN-BASED SYSTEM (57) Abstract: Disclosed herein are methods, systems, and apparatus, including 600 computer programs encoded on computer storage media, for storing keys of a num ber of key-value pairs by a network node of a blockchain network. One of the meth ods includes maintaining data representing a forest that stores a number of keys of Maintain data representing a forestthat 602 the number of key-value pairs that are stored in a map. The forest includes a number storesa plurality of keysofa plurality of of trees, each tree includes a respective number of storage nodes, and each storage key-value pairsthat are stored in a map node stores a subset of the number of keys. The network node receives a request to I add a key of a key-value pair into the forest, the key-value pair stored in the map. Receive ars d 604 A first hash value of the key is computed using a first hash function. One of the value pairinto the forest number of trees to store the key is determined based on the first hash value. The network node determines a target storage node of the one of the number of trees to 606 store the key, and stores the key in the target storage node. Compute a first hash value of the key using a first hash function Determine one of a plurality of trees to store the key based on the first hash value Determine a target storage node ofthe one of the plurality of trees to store the key Store the key in the target storage node (1 FIG. 6 W O 2020/098820 A3||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||| Published: - with international search report (Art. 21(3)) - before the expiration of the time limit for amending the claims and to be republished in the event of receipt of amendments (Rule 48.2(h)) - upon request of the applicant, before the expiration of the time limit referred to in Article 21(2)(a) (88) Date of publication of the international search report: 08 October 2020 (08.10.2020)
更多详情内容请
点击查看