Services & ResourcesWolfram ForumsMathGroup Archive

[Date Index] [Thread Index] [Author Index]

Searching algorithm

• To: mathgroup at smc.vnet.net
• Subject: [mg48253] Searching algorithm
• From: "Amir" <z64043 at netscape.net>
• Date: Wed, 19 May 2004 02:42:49 -0400 (EDT)
• Sender: owner-wri-mathgroup at wolfram.com

Hello,

A =  2x2 matrix {{1,8,9,4,6,3},{1,7,9,11,8,54},{73,2,1,61,8,9},...}

Is there any algorithm which can find the most frequent subset of three
numbers ( like {1,8,9} ) that appears in  A ?

Thanks,

Amir

• Follow-Ups:
  • Re: Searching algorithm
    • From: Omega Consulting <info@omegaconsultinggroup.com>