python (65.2k questions)
javascript (44.3k questions)
reactjs (22.7k questions)
java (20.8k questions)
c# (17.4k questions)
html (16.3k questions)
r (13.7k questions)
android (13k questions)
Faster algorithm for lexicographic comparison of DNA strings
I'm trying to find a faster way to do the following:
Given a list of DNA strings x = ([s1, s2, s3, s4...]) (where the strings can only consist of the letters 'A', 'T', 'C', and 'G') and a list of inde...
nunya
Votes: 0
Answers: 0
Is there a way to jump over specific strings on an iteration of a list of strings that is sorted lexicographically in Java?
I have a list of strings lst that is sorted lexicographically and I want to iterate over the list in a way that each iteration, I jump to a string that starts with the following letter of the first le...
Tomer Sivan
Votes: 0
Answers: 2
Is there an efficient algorithm for outputting all strings stored in a sorted lexicographically list that are a permutation of an input string?
I would like to find the most efficient algorithm for this problem:
Given a string str and a list of strings lst that consists of only lowercase English characters and is sorted lexicographically, fin...
Tomer Sivan
Votes: 0
Answers: 2
R Code package markovchain doesn't properly recognize numbers as states
I have checked the documentation of the package and found an example of how they fitted a DTMC on data.frame objects using the following code:
library(holson)
data(holson)
singleMc<-markovchainFit(...
Hermann Josef
Votes: 0
Answers: 1