An optimal algorithm for maximum-sum segment and its application in bioinformatics

Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/33502

Title:	An optimal algorithm for maximum-sum segment and its application in bioinformatics
Authors:	Fan,TH;Lee,SF;Lu,HI;Tsou,TS;Wang,TC;Yao,A
Contributors:	統計研究所
Keywords:	GENOME
Date:	2003
Issue Date:	2010-07-07 11:34:30 (UTC+8)
Publisher:	中央大學
Abstract:	We study a fundamental sequence algorithm arising from bioinformatics. Given two integers L and U and a sequence A of n numbers, the maximum-sum segment problem is to find a segment A[i, j] of A with L less than or equal to j-i+1 less than or equal to U t
Relation:	IMPLEMENTATION AND APPLICATION OF AUTOMATA, PROCEEDINGS
Appears in Collections:	[Graduate Institute of Statistics] journal & Dissertation

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	428	View/Open

社群 sharing