METHOD FOR SEQUENCE HOMOLOGY SEARCH OF NUCLEOTIDE DATABASE

• Main Authors: JOH, Yoonsung, LEE, Won Kyung, PARK, Heejin, YOON, Gi Seok, JEON, Jae Hyeon, JUNG, Dong Min
• Format: Patent
• Language: English; French; Korean
• Published: 27.06.2024
• Subjects: BEER; BIOCHEMISTRY; CHEMISTRY; COMPOSITIONS OR TEST PAPERS THEREFOR; CONDITION-RESPONSIVE CONTROL IN MICROBIOLOGICAL ORENZYMOLOGICAL PROCESSES; ENZYMOLOGY; INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTEDFOR SPECIFIC APPLICATION FIELDS; MEASURING OR TESTING PROCESSES INVOLVING ENZYMES, NUCLEICACIDS OR MICROORGANISMS; METALLURGY; MICROBIOLOGY; MUTATION OR GENETIC ENGINEERING; PHYSICS; PROCESSES OF PREPARING SUCH COMPOSITIONS; SPIRITS; VINEGAR; WINE

The present invention relates to a method for a sequence homology search of a subject sequence database, and most specifically, to a method for searching for a subject sequence homologous to a query sequence, in particular a subject sequence having no more than N mismatches with the query sequence. The method according to the present invention can greatly improve search accuracy and speed by fragmenting the query sequence into at least (N+1) fragments and comparing the fragments with substrings of the subject sequence. La présente invention concerne un procédé de recherche d'homologie de séquence d'une base de données de séquence de sujet, et plus spécifiquement, un procédé de recherche d'une séquence de sujet homologue à une séquence d'interrogation, en particulier une séquence de sujet n'ayant pas plus de N discordances avec la séquence d'interrogation. Le procédé selon la présente invention peut améliorer considérablement la précision et la vitesse de recherche en fragmentant la séquence d'interrogation en au moins (N+1) fragments et en comparant les fragments à des sous-chaînes de la séquence de sujet. 본 개시내용은 서브젝트 서열의 데이터베이스에 대한 쿼리 서열의 서열 유사성 검색 방법, 가장 구체적으로는 쿼리 서열과 유사한, 특히 N개 이하의 미스매치를 갖는, 서브젝트 서열을 검색하는 방법에 관한 것이다. 본 발명의 방법은 쿼리 서열을 적어도 N+1개의 단편으로 단편화하고 서브젝트 서열의 서브스트링과 비교함으로써 검색 정확도 및 속도를 크게 개선할 수 있다.