linksplatform / linksplatform/Data.Doublets
Use bitstring/bitarray indexes
Nobody has claimed this yet.
- Dominant language
- C#
- Stars
- 14
- Forks
- 5
- PR merge metrics
- No merged PRs in 30d
Description
Each subsequence/fragment (or may be just pairs) should have bitstrings, that contain bits corresponding to sequences links.
That will give an ability to search for sequences faster. For example we can scan pairs of the elements of the sequence to find less frequent once, from them we can get 2 or more least frequent fragments, load their bitstrings and intersect them to get the set of possible matches.
This way it will be possible to narrow the search space, and get relevant results faster.
Contributor guide
No contributing guide indexed for this repository
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
No file or test is named. Start by locating the sequence-search and link-representation code, then determine how subsequences, fragments, or pairs could map to bitstrings and how candidate matches would be intersected. Done should include a defined index design and evidence that it narrows the search space and improves search speed.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- csharp
- Domain
- databases, search
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100