Swift implementation of the longest common subsequence (LCS) algorithm
What is SwiftLCS?
SwitLCS provides an extension of Collection that finds the indexes of the longest common subsequence with another collection.
The longest common subsequence (LCS) problem is the problem of finding the longest subsequence common to all sequences in a set of sequences (often just two sequences). It differs from problems of finding common substrings: unlike substrings, subsequences are not required to occupy consecutive positions within the original sequences.
Overview
- Pricing: Free
- Resource Link: https://github.com/Frugghi/SwiftLCS
- Resource Maker: Tommaso Madonia
- Mobile Platform Destination: iOS Apps
- Mobile Platform Support: Native iOS
- Programming Languages: Swift
- CocoaPods: SwiftLCS
- Carthage: Frugghi/SwiftLCS
- Swift Package Manager: https://github.com/Frugghi/SwiftLCS.git
The team behind mobintouch
Website: https://www.mobintouch.com
Resources added 👉 3142
Related resources
Brisk
A Swift DSL that allows concise and effective concurrency manipulation
YPImagePicker
Instagram-like image picker & filters for iOS
Datez
Swift library for dealing with NSDate, NSCalendar, and NSDateComponents