Swiftly Computing Center Strings

Hufsky F, Kuchenbecker L, Jahn K, Stoye J, Böcker S (2010)
In: Proc. of WABI 2010. LNBI, 6293. 325-336.

Conference Paper | Published | English

No fulltext has been uploaded

Author
; ; ; ;
Publishing Year
Conference
WABI 2010
PUB-ID

Cite this

Hufsky F, Kuchenbecker L, Jahn K, Stoye J, Böcker S. Swiftly Computing Center Strings. In: Proc. of WABI 2010. LNBI. Vol 6293. 2010: 325-336.
Hufsky, F., Kuchenbecker, L., Jahn, K., Stoye, J., & Böcker, S. (2010). Swiftly Computing Center Strings. Proc. of WABI 2010, 6293, 325-336.
Hufsky, F., Kuchenbecker, L., Jahn, K., Stoye, J., and Böcker, S. (2010). “Swiftly Computing Center Strings” in Proc. of WABI 2010 LNBI, vol. 6293, 325-336.
Hufsky, F., et al., 2010. Swiftly Computing Center Strings. In Proc. of WABI 2010. LNBI. no.6293 pp. 325-336.
F. Hufsky, et al., “Swiftly Computing Center Strings”, Proc. of WABI 2010, LNBI, vol. 6293, 2010, pp.325-336.
Hufsky, F., Kuchenbecker, L., Jahn, K., Stoye, J., Böcker, S.: Swiftly Computing Center Strings. Proc. of WABI 2010. LNBI. 6293, p. 325-336. (2010).
Hufsky, Franziska, Kuchenbecker, Leon, Jahn, Katharina, Stoye, Jens, and Böcker, Sebastian. “Swiftly Computing Center Strings”. Proc. of WABI 2010. 2010.Vol. 6293. LNBI. 325-336.
This data publication is cited in the following publications:
This publication cites the following data publications:

16 References

Data provided by Europe PubMed Central.

Distinguishing string selection problems
AUTHOR UNKNOWN, 2003
Effective Algorithms for the Closest String and Distinguishing String Selection Problems
AUTHOR UNKNOWN, 2009
Degenerated primer design to amplify the heavy chain variable region from immunoglobulin cDNA.
Wang Y, Chen W, Li X, Cheng B., BMC Bioinformatics 7 Suppl 4(), 2006
PMID: 17217527
Fast and Practical Algorithms for Planted (l, d) Motif Search
AUTHOR UNKNOWN, 2007
Integer linear programming techniques for discovering approximate gene clusters
AUTHOR UNKNOWN, 2008
Computation of median gene clusters.
Bocker S, Jahn K, Mixtacki J, Stoye J., J. Comput. Biol. 16(8), 2009
PMID: 19689215
On covering problems of codes
AUTHOR UNKNOWN, 1997
More Effective Algorithms for Closest String and Substring Problems
AUTHOR UNKNOWN, 2009
Parallel Genetic Algorithm and Parallel Simulated Annealing Algorithm for the Closest String Problem
AUTHOR UNKNOWN, 2005
Ant-CSP: An Ant Colony Optimization Algorithm for the Closest String Problem
AUTHOR UNKNOWN, 2010
Fixed-parameter algorithms for Closest String and related problems
AUTHOR UNKNOWN, 2003
A Three-String Approach to the Closest String Problem
AUTHOR UNKNOWN, 2010
Optimal solutions for the closest-string problem via integer programming
AUTHOR UNKNOWN, 2004
The Exact Closest String Problem as a Constraint Satisfaction Problem
AUTHOR UNKNOWN, 2010
Hardness results for the center and median string problems under the weighted and unweighted edit distances
AUTHOR UNKNOWN, 2005

Export

0 Marked Publications

Open Data PUB

Web of Science

View record in Web of Science®

Sources

PMID: 21504573
PubMed | Europe PMC

Search this title in

Google Scholar
ISBN Search