A Near-Optimal Algorithm to Count Occurrences of Subsequences of a Given Length [0.03%]
计算给定长度子序列出现次数的几乎最优算法
Jose Torres-Jimenez,Idelfonso Izquierdo-Marquez,Daniel Ramirez-Acuna et al.
Jose Torres-Jimenez et al.
For k ∈ ℤ+, define Σ k as the set of integers {0, 1, …, k - 1}. Given an integer n and a string t of length m ≥ n over Σ k , we count the number of times that each one of the kn distinct strings of length n over Σ k occurs as a subse...
AN EFFICIENT ALGORITHM FOR CHINESE POSTMAN WALK ON BI-DIRECTED DE BRUIJN GRAPHS [0.03%]
有向德布鲁因图上的中国邮路问题的高效算法研究
Vamsi Kundeti,Sanguthevar Rajasekaran,Heiu Dinh
Vamsi Kundeti
Sequence assembly from short reads is an important problem in biology. It is known that solving the sequence assembly problem exactly on a bi-directed de Bruijn graph or a string graph is intractable. However, finding a shortest double stra...