Swiftly Computing Center Strings

Hufsky F, Kuchenbecker L, Jahn K, Stoye J, Böcker S (2011)
BMC Bioinformatics 12(1): 106.

Download
Es wurde kein Volltext hochgeladen. Nur Publikationsnachweis!
Zeitschriftenaufsatz | Veröffentlicht | Englisch
Autor
; ; ; ;
Erscheinungsjahr
Zeitschriftentitel
BMC Bioinformatics
Band
12
Zeitschriftennummer
1
Seite
106
ISSN
PUB-ID

Zitieren

Hufsky F, Kuchenbecker L, Jahn K, Stoye J, Böcker S. Swiftly Computing Center Strings. BMC Bioinformatics. 2011;12(1):106.
Hufsky, F., Kuchenbecker, L., Jahn, K., Stoye, J., & Böcker, S. (2011). Swiftly Computing Center Strings. BMC Bioinformatics, 12(1), 106. doi:10.1186/1471-2105-12-106
Hufsky, F., Kuchenbecker, L., Jahn, K., Stoye, J., and Böcker, S. (2011). Swiftly Computing Center Strings. BMC Bioinformatics 12, 106.
Hufsky, F., et al., 2011. Swiftly Computing Center Strings. BMC Bioinformatics, 12(1), p 106.
F. Hufsky, et al., “Swiftly Computing Center Strings”, BMC Bioinformatics, vol. 12, 2011, pp. 106.
Hufsky, F., Kuchenbecker, L., Jahn, K., Stoye, J., Böcker, S.: Swiftly Computing Center Strings. BMC Bioinformatics. 12, 106 (2011).
Hufsky, Franziska, Kuchenbecker, Leon, Jahn, Katharina, Stoye, Jens, and Böcker, Sebastian. “Swiftly Computing Center Strings”. BMC Bioinformatics 12.1 (2011): 106.

16 References

Daten bereitgestellt von 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

Markieren/ Markierung löschen
Markierte Publikationen

Open Data PUB

Web of Science

Dieser Datensatz im Web of Science®

Quellen

PMID: 21504573
PubMed | Europe PMC

Suchen in

Google Scholar