Python all_kmers 예제들

예제 #1

# Input: An integer k and a string Text.
# Output: DeBruijnk(Text).

# Sample Input:
#      4
#      AAGATTCTCTAC

# Sample Output:
#      AAG -> AGA
#      AGA -> GAT
#      ATT -> TTC
#      CTA -> TAC
#      CTC -> TCT
#      GAT -> ATT
#      TCT -> CTA,CTC
#      TTC -> TCT

import inout
import common

k = int(inout.infilelines[0].strip())
sequence = inout.infilelines[1].strip()

graph = common.debruijn_graph(common.all_kmers(sequence, k))

graph_strs = []
for k, v in graph.iteritems():
    graph_strs.append(common.debruijn_to_str(k, v))

inout.output('\n'.join(graph_strs))

예제 #2

파일: Stepic-51-3.py 프로젝트: zjg540066169/Bioinformatics_learning

# Input: An integer k and a string Text.
# Output: Compositionk(Text), where the k-mers are written in lexicographic order.

# Sample Input:
#      5
#      CAATCCAAC

# Sample Output:
#      AATCC
#      ATCCA
#      CAATC
#      CCAAC
#      TCCAA

import inout
import common

k = int(inout.infilelines[0].strip())
sequence = inout.infilelines[1].strip()

kmers = sorted(common.all_kmers(sequence, k))

inout.output('\n'.join(kmers))

예제 #3

파일: Stepic-53-6.py 프로젝트: chungtseng/rosalind

# Input: An integer k and a string Text.
# Output: DeBruijnk(Text).

# Sample Input:
#      4
#      AAGATTCTCTAC

# Sample Output:
#      AAG -> AGA
#      AGA -> GAT
#      ATT -> TTC
#      CTA -> TAC
#      CTC -> TCT
#      GAT -> ATT
#      TCT -> CTA,CTC
#      TTC -> TCT
     
import inout
import common

k = int(inout.infilelines[0].strip())
sequence = inout.infilelines[1].strip()

graph = common.debruijn_graph(common.all_kmers(sequence, k))		

graph_strs = []
for k,v in graph.iteritems():
	graph_strs.append(common.debruijn_to_str(k,v))

inout.output('\n'.join(graph_strs))