If you have a new account but are having problems posting or verifying your account, please email us on hello@boards.ie for help. Thanks :)

Hello all! Please ensure that you are posting a new thread or question in the appropriate forum. The Feedback forum is overwhelmed with questions that are having to be moved elsewhere. If you need help to verify your account contact hello@boards.ie

Finding the largest sub vector in a sequence

neonic75 · 2009-09-14 10:52:42

Hi folks, I need to find the largest sub-vector from a sequence of integers, both positive and negative. For example: 6,94,-63,-41,20,5,-61,83,-14,-50, 36,30,32,51,96,72,99,23,-59,-23, The largest sub vector here is 6,94,-63,-41,20,5,-61,83,-14,-50, 36,30,32,51,96,72,99,23,-59,-23, Any ideas? Is there an algorithim that…

14-09-2009 11:52AM

#1

neonic75

Registered Users, Registered Users 2 Posts: 46 ✭

Join Date: January 2009

Posts: 36

Hi folks,
I need to find the largest sub-vector from a sequence of integers, both positive and negative. For example:

6,94,-63,-41,20,5,-61,83,-14,-50,
36,30,32,51,96,72,99,23,-59,-23,
The largest sub vector here is
6,94,-63,-41,20,5,-61,83,-14,-50,
36,30,32,51,96,72,99,23,-59,-23,

Any ideas?
Is there an algorithim that will do this?
Cheers

0

Comments

#2 14-09-2009 01:07PM

cavedave

Registered Users, Registered Users 2 Posts: 2,164 ✭✭✭

Join Date: March 2005

Posts: 2055

This is called the largest subsequence problem. There is stuff on it here and here. Both these seem to use dynamic programming.

0