➜

This issue tracker has been migrated to GitHub, and is currently read-only.
For more information, see the GitHub FAQs in the Python's Developer Guide.

Author Contego
Recipients Contego
Date 2016-01-19.11:06:38
SpamBayes Score -1.0
Marked as misclassified Yes
Message-id <1453201598.83.0.994407990741.issue26150@psf.upfronthosting.co.za>
In-reply-to
Content 
For strings 'aaaaaa', 'aabaaa' SequenceMatcher's algorithm finds only common substring 'aaa', while well-known classic LCS algorithm: http://www.geeksforgeeks.org/printing-longest-common-subsequence/ finds 'aa' and 'aaa'.

Is it the price for "best case time is linear", as mentioned in difflib's documentation? Are there any other reasons not to implement classic LCS algorith (e.g. memory limits?)? If no, maybe it will be usefull to create subclass StrictSequenceMatcher?
History
Date User Action Args
2016-01-19 11:06:38Contegosetrecipients: + Contego
2016-01-19 11:06:38Contegosetmessageid: <1453201598.83.0.994407990741.issue26150@psf.upfronthosting.co.za>
2016-01-19 11:06:38Contegolinkissue26150 messages
2016-01-19 11:06:38Contegocreate