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

sublist clearing

• To: mathgroup at smc.vnet.net
• Subject: [mg123157] sublist clearing
• From: borges2003xx <borges2003xx at gmail.com>
• Date: Fri, 25 Nov 2011 04:53:36 -0500 (EST)
• Delivered-to: l-mathgroup@mail-archive0.wolfram.com

I need to clear a list in which there are two sublist ,not overlapping
with a property
i.e., in this case,equals and with length >= 2)
mm[{___, b1__, ___, b1__, ___}] := {} /; Length[{b1}] >= 2

or for example 2 sublists, with a similarity function equal 0 and
Legth = 4
mm[{___, b1__, ___, b2__, ___}] := {} /;
  NeedlemanWunschSimilarity[{b1}, {b2}] == 0 && Length[{b1}] == 4 &&
   Length[{b2}] == 4
and so on.....

For mathematica, guru who know internal algorithm is there a faster
way, perhaps using PatternTest (?).