Presentation	1998/9/24 Genome walking as search Teruhisa MIURA, Toru ISHIDA,
PDF Download Page	PDF download Page Link
Abstract(in Japanese)	(See Japanese page)
Abstract(in English)	The development of the sequence fragment database enables us to infer the complete sequence of gene by genome sequence walking. This is a technique of inferring the complete sequence of gene from given fragment of the sequence by searching through the huge database of gene fragments and assembling fragments which belongs to the same gene as given fragment does. There are 1.8 million fragment sequences which belong to various gene in the database. It is difficult to find the set of fragments which belong to the same gene in the database and assemble them according to their overlaps. In this paper, we formalize the genome sequence walking as search based on sequence reconstruction problem. Then we discuss the genome sequence walking in terms of search.
Keyword(in Japanese)	(See Japanese page)
Keyword(in English)	Search / Genome Sequence Walking / Sequence Reconstruct Problem
Paper #	AI98-39
Date of Issue

Conference Information
Committee	AI
Conference Date	1998/9/24(1days)
Place (in Japanese)	(See Japanese page)
Place (in English)
Topics (in Japanese)	(See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To	Artificial Intelligence and Knowledge-Based Processing (AI)
Language	JPN
Title (in Japanese)	(See Japanese page)
Sub Title (in Japanese)	(See Japanese page)
Title (in English)	Genome walking as search
Sub Title (in English)
Keyword(1)	Search
Keyword(2)	Genome Sequence Walking
Keyword(3)	Sequence Reconstruct Problem
1st Author's Name	Teruhisa MIURA
1st Author's Affiliation	Department of Social Informatics, Kyoto University()
2nd Author's Name	Toru ISHIDA
2nd Author's Affiliation	Department of Social Informatics, Kyoto University
Date	1998/9/24
Paper #	AI98-39
Volume (vol)	vol.98
Number (no)	296
Page	pp.pp.-
#Pages	8
Date of Issue